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:24anboto1anboto1Score: 57,824Success
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:2557,602290,920,236281,151,0001,099,0002,113,536
2Aug 3, 2026 21:2557,631290,912,569281,208,0001,188,0002,113,536
3Aug 3, 2026 21:2557,647291,329,321281,389,0001,086,0002,113,536
4Aug 3, 2026 21:2557,788291,789,606282,068,0001,098,0002,113,536
5Aug 3, 2026 21:2557,824292,469,051282,328,0001,014,0002,113,536
6Aug 3, 2026 21:2558,272294,793,833284,526,0001,011,0002,113,536
7Aug 3, 2026 21:2558,510295,778,032285,587,0001,116,0002,113,536
8Aug 3, 2026 21:2558,757297,014,550286,781,0001,133,0002,113,536
9Aug 3, 2026 21:2559,027298,295,905288,154,0001,082,0002,113,536