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:09Andrew EpsteinAndrew EpsteinScore: 214,759Success
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:10214,5731,061,846,3061,049,390,0002,019,0002,117,632stderr
2Sep 24, 2026 15:10214,5801,061,669,0441,050,434,0001,008,0002,117,632stderr
3Sep 24, 2026 15:10214,6821,062,399,9351,050,943,0001,003,0002,117,632stderr
4Sep 24, 2026 15:10214,7551,063,951,8981,051,290,0001,013,0002,117,632stderr
5Sep 24, 2026 15:10214,7591,062,611,1521,051,311,0001,009,0002,117,632stderr
6Sep 24, 2026 15:10214,7881,063,004,3881,051,453,0001,012,0002,117,632stderr
7Sep 24, 2026 15:10214,8441,063,038,1671,051,736,0001,001,0002,117,632stderr
8Sep 24, 2026 15:10214,9341,063,636,1141,051,163,0002,017,0002,117,632stderr
9Sep 24, 2026 15:10214,9581,063,674,8491,052,294,0001,005,0002,117,632stderr