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 listAug 24, 2026 19:14Victor MerckléVictor MerckléScore: 28,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:1528,100146,110,371135,666,0002,028,0002,117,632stderr
2Aug 24, 2026 19:1528,163146,386,807136,989,0001,010,0002,117,632stderr
3Aug 24, 2026 19:1528,171146,946,993137,032,0001,010,0002,117,632stderr
4Aug 24, 2026 19:1528,277146,910,656136,552,0002,007,0002,117,632stderr
5Aug 24, 2026 19:1528,301147,044,593136,655,0002,022,0002,117,632stderr
6Aug 24, 2026 19:1528,331147,278,385136,809,0002,015,0002,117,632stderr
7Aug 24, 2026 19:1528,339147,287,836137,855,0001,010,0002,117,632stderr
8Aug 24, 2026 19:1528,698149,027,932139,611,0001,010,0002,117,632stderr
9Aug 24, 2026 19:1529,568153,358,804143,877,0001,011,0002,117,632stderr