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 21:14anboto1anboto1Score: 57,642Success
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 21:1557,533291,096,254280,794,0001,119,0002,113,536
2Aug 3, 2026 21:1557,544291,060,857280,875,0001,093,0002,113,536
3Aug 3, 2026 21:1557,551291,132,614280,872,0001,131,0002,113,536
4Aug 3, 2026 21:1557,592290,705,592281,066,0001,138,0002,113,536
5Aug 3, 2026 21:1557,642291,513,493281,338,0001,112,0002,113,536
6Aug 3, 2026 21:1557,670291,620,034281,428,0001,157,0002,113,536
7Aug 3, 2026 21:1558,036294,516,030283,285,0001,092,0002,113,536
8Aug 3, 2026 21:1558,206293,672,154284,056,0001,156,0002,113,536
9Aug 3, 2026 21:1558,490295,774,631285,347,0001,254,0002,113,536