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:09Andrew EpsteinAndrew EpsteinScore: 355,036Success
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:10354,6301,748,241,0521,736,583,0001,107,0002,117,632stderr
2Sep 24, 2026 14:10354,6751,748,423,7951,736,800,0001,111,0002,117,632stderr
3Sep 24, 2026 14:10354,8251,749,277,1821,736,479,0002,165,0002,117,632stderr
4Sep 24, 2026 14:10354,9791,750,133,3071,737,108,0002,292,0002,117,632stderr
5Sep 24, 2026 14:10355,0361,750,161,7871,738,452,0001,227,0002,117,632stderr
6Sep 24, 2026 14:10361,0331,779,614,6001,767,945,0001,120,0002,117,632stderr
7Sep 24, 2026 14:10361,2891,781,491,3761,769,206,0001,112,0002,117,632stderr
8Sep 24, 2026 14:10361,4161,782,188,3171,769,815,0001,124,0002,117,632stderr
9Sep 24, 2026 14:10361,9041,783,843,9401,772,216,0001,114,0002,117,632stderr