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 16:12Josu San MartinJosu San MartinScore: 32,345Success
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 16:1332,247167,194,660156,753,0001,262,0002,113,536
2Aug 3, 2026 16:1332,293166,484,579156,978,0001,262,0002,113,536
3Aug 3, 2026 16:1332,293167,469,514156,971,0001,267,0002,113,536
4Aug 3, 2026 16:1332,329167,512,372157,143,0001,271,0002,113,536
5Aug 3, 2026 16:1332,345167,573,547157,232,0001,263,0002,113,536
6Aug 3, 2026 16:1332,350167,744,637157,395,0001,120,0002,113,536
7Aug 3, 2026 16:1334,250176,875,999166,804,0001,025,0002,113,536
8Aug 3, 2026 16:1337,198191,233,039181,002,0001,273,0002,117,632
9Aug 3, 2026 16:1337,208191,387,599181,277,0001,044,0002,113,536