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 24, 2026 18:49Andrew EpsteinAndrew EpsteinScore: 221,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 18:50220,8921,092,839,9991,081,260,0001,114,0002,117,632stderr
2Sep 24, 2026 18:50221,0151,094,288,7581,080,793,0002,182,0002,117,632stderr
3Sep 24, 2026 18:50221,0171,094,253,8201,081,857,0001,128,0002,117,632stderr
4Sep 24, 2026 18:50221,1381,094,228,1841,081,442,0002,137,0002,117,632stderr
5Sep 24, 2026 18:50221,1821,095,120,0901,082,684,0001,111,0002,117,632stderr
6Sep 24, 2026 18:50221,1961,094,346,2151,082,748,0001,117,0002,117,632stderr
7Sep 24, 2026 18:50221,3751,095,589,3811,083,619,0001,122,0002,117,632stderr
8Sep 24, 2026 18:50222,4641,100,722,0661,088,956,0001,121,0002,117,632stderr
9Sep 24, 2026 18:50225,2221,114,307,1401,101,427,0002,165,0002,117,632stderr