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 3, 2026 18:10Josu San MartinJosu San MartinScore: 29,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:1029,165151,101,008141,655,0001,256,0002,113,536
2Aug 3, 2026 18:1029,172151,334,880141,686,0001,260,0002,113,536
3Aug 3, 2026 18:1029,207151,536,221141,856,0001,262,0002,113,536
4Aug 3, 2026 18:1029,207151,341,039142,080,0001,038,0002,113,536
5Aug 3, 2026 18:1029,218151,586,278141,976,0001,195,0002,113,536
6Aug 3, 2026 18:1029,259151,821,694142,343,0001,029,0002,113,536
7Aug 3, 2026 18:1029,317152,021,978142,480,0001,175,0002,113,536
8Aug 3, 2026 18:1029,464152,784,733143,368,0001,009,0002,113,536
9Aug 3, 2026 18:1031,314161,928,132152,425,0001,014,0002,113,536