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 listMay 11, 2026 15:58wnwnScore: 104,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:00103,948517,761,534508,341,0001,005,0002,113,536
2May 11, 2026 16:00104,080519,019,197507,982,0002,012,0002,113,536
3May 11, 2026 16:00104,109519,479,497508,092,0002,044,0002,113,536
4May 11, 2026 16:00104,164519,241,884508,383,0002,021,0002,113,536
5May 11, 2026 16:00104,179518,833,530509,475,0001,004,0002,113,536
6May 11, 2026 16:00104,197520,453,714508,532,0002,034,0002,113,536
7May 11, 2026 16:00104,228519,785,961509,713,0001,005,0002,113,536
8May 11, 2026 16:00104,284518,562,875509,990,0001,004,0002,113,536
9May 11, 2026 16:00104,545519,608,051511,271,0001,004,0002,113,536