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 28, 2026 23:23Josu San MartinJosu San MartinScore: 38,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 23:2438,226195,697,872164,989,00022,323,0002,117,632
2Aug 28, 2026 23:2438,288196,055,630165,339,00022,276,0002,117,632
3Aug 28, 2026 23:2438,295196,057,180165,346,00022,302,0002,117,632
4Aug 28, 2026 23:2438,297196,077,048165,357,00022,302,0002,113,536
5Aug 28, 2026 23:2438,367198,175,628165,512,00022,490,0002,117,632
6Aug 28, 2026 23:2438,430196,732,858165,945,00022,366,0002,117,632
7Aug 28, 2026 23:2438,520197,135,018166,475,00022,273,0002,117,632
8Aug 28, 2026 23:2438,529197,933,229166,011,00022,783,0002,113,536
9Aug 28, 2026 23:2438,561197,940,976166,601,00022,349,0002,113,536