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 listSep 19, 2026 13:27Andrew EpsteinAndrew EpsteinScore: 90,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:3590,240452,348,991414,878,00027,298,00036,864stderr
2Sep 19, 2026 13:3590,384453,068,821415,015,00027,869,00036,864stderr
3Sep 19, 2026 13:3590,417453,330,185415,274,00027,773,00032,768stderr
4Sep 19, 2026 13:3590,444453,442,247415,227,00027,953,00036,864stderr
5Sep 19, 2026 13:3590,462453,691,324415,108,00028,156,00036,864stderr
6Sep 19, 2026 13:3590,488453,681,393415,137,00028,255,0002,129,920stderr
7Sep 19, 2026 13:3590,516453,885,374415,079,00028,452,00036,864stderr
8Sep 19, 2026 13:3590,534454,022,468415,134,00028,486,00032,768stderr
9Sep 19, 2026 13:3590,555454,012,693415,193,00028,527,00032,768stderr