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 1, 2026 09:47Josu San MartinJosu San MartinScore: 35,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 09:4835,460183,875,185172,637,0001,120,0002,113,536
2Aug 1, 2026 09:4835,464184,652,668172,663,0001,111,0002,113,536
3Aug 1, 2026 09:4835,467183,828,586172,687,0001,103,0002,113,536
4Aug 1, 2026 09:4835,469184,014,960172,677,0001,124,0002,113,536
5Aug 1, 2026 09:4835,471185,858,924172,682,0001,128,0002,113,536
6Aug 1, 2026 09:4835,473183,894,415172,712,0001,109,0002,113,536
7Aug 1, 2026 09:4835,473183,874,327172,691,0001,130,0002,113,536
8Aug 1, 2026 09:4835,489183,999,816172,771,0001,128,0002,113,536
9Aug 1, 2026 09:4835,500184,032,746172,833,0001,119,0002,113,536