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 15:19Andrew EpsteinAndrew EpsteinScore: 263,107Success
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 15:20262,9741,299,068,8141,287,469,0001,107,0002,117,632stderr
2Sep 24, 2026 15:20262,9751,299,118,4481,287,458,0001,120,0002,117,632stderr
3Sep 24, 2026 15:20262,9851,299,155,1781,287,411,0001,216,0002,117,632stderr
4Sep 24, 2026 15:20263,0491,299,637,5121,287,814,0001,127,0002,117,632stderr
5Sep 24, 2026 15:20263,1071,299,843,4711,288,116,0001,113,0002,117,632stderr
6Sep 24, 2026 15:20263,1161,299,872,3401,288,037,0001,235,0002,117,632stderr
7Sep 24, 2026 15:20263,1341,300,555,4341,288,254,0001,104,0002,117,632stderr
8Sep 24, 2026 15:20263,1551,300,146,3401,288,327,0001,137,0002,117,632stderr
9Sep 24, 2026 15:20264,3141,305,960,3071,292,991,0002,152,0002,117,632stderr