Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 4, 2026 08:08Josu San MartinJosu San MartinScore: 26,124Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 08:0926,029135,921,399126,291,0001,252,0002,113,536
2Aug 4, 2026 08:0926,046136,718,690126,364,0001,265,0002,113,536
3Aug 4, 2026 08:0926,048136,498,764126,367,0001,270,0002,113,536
4Aug 4, 2026 08:0926,112136,634,774126,691,0001,261,0002,113,536
5Aug 4, 2026 08:0926,124136,408,715126,745,0001,267,0002,113,536
6Aug 4, 2026 08:0926,131136,518,469126,771,0001,273,0002,113,536
7Aug 4, 2026 08:0926,132136,460,522126,799,0001,252,0002,113,536
8Aug 4, 2026 08:0926,160137,312,908127,171,0001,013,0002,113,536
9Aug 4, 2026 08:0927,016140,799,847131,131,0001,250,0002,113,536