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 25, 2026 17:05Andrew EpsteinAndrew EpsteinScore: 236,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 17:05236,6351,170,055,1651,158,394,0001,121,0002,117,632stderr
2Sep 25, 2026 17:05236,6531,170,163,1521,158,486,0001,114,0002,117,632stderr
3Sep 25, 2026 17:05236,7031,170,369,9861,158,737,0001,111,0002,117,632stderr
4Sep 25, 2026 17:05236,7121,170,488,6111,158,783,0001,108,0002,117,632stderr
5Sep 25, 2026 17:05236,7621,171,412,7661,159,029,0001,109,0002,117,632stderr
6Sep 25, 2026 17:05236,7731,171,370,0631,159,084,0001,108,0002,117,632stderr
7Sep 25, 2026 17:05236,7801,170,744,0301,159,115,0001,109,0002,117,632stderr
8Sep 25, 2026 17:05236,8251,171,044,2521,159,334,0001,113,0002,117,632stderr
9Sep 25, 2026 17:05236,9051,171,477,3421,158,625,0002,213,0002,117,632stderr