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:51Andrew EpsteinAndrew EpsteinScore: 235,598Success
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:52235,2991,163,554,6531,151,858,0001,108,0002,117,632stderr
2Sep 24, 2026 14:52235,3801,164,615,6141,152,253,0001,109,0002,117,632stderr
3Sep 24, 2026 14:52235,4831,164,315,4801,152,743,0001,125,0002,117,632stderr
4Sep 24, 2026 14:52235,5331,164,675,7681,153,009,0001,103,0002,117,632stderr
5Sep 24, 2026 14:52235,5981,165,025,7651,153,320,0001,113,0002,117,632stderr
6Sep 24, 2026 14:52236,7251,172,899,5021,158,845,0001,112,0002,117,632stderr
7Sep 24, 2026 14:52237,1431,172,587,2791,160,887,0001,118,0002,117,632stderr
8Sep 24, 2026 14:52238,1401,177,374,0931,165,779,0001,111,0002,117,632stderr
9Sep 24, 2026 14:52242,2351,197,532,5461,185,834,0001,120,0002,117,632stderr