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 14:32Andrew EpsteinAndrew EpsteinScore: 323,064Success
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 14:33322,7091,592,551,6641,580,175,0001,100,0002,117,632stderr
2Sep 24, 2026 14:33322,8511,592,519,3711,580,842,0001,128,0002,117,632stderr
3Sep 24, 2026 14:33322,9531,592,937,5681,581,359,0001,112,0002,117,632stderr
4Sep 24, 2026 14:33323,0241,593,517,0701,581,714,0001,108,0002,117,632stderr
5Sep 24, 2026 14:33323,0641,593,616,3061,581,905,0001,113,0002,117,632stderr
6Sep 24, 2026 14:33323,1341,594,488,2611,582,249,0001,108,0002,117,632stderr
7Sep 24, 2026 14:33323,1351,594,083,2091,582,251,0001,114,0002,117,632stderr
8Sep 24, 2026 14:33323,1901,594,161,6651,582,521,0001,110,0002,117,632stderr
9Sep 24, 2026 14:33323,7871,597,116,2651,585,433,0001,126,0002,117,632stderr