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 25, 2026 15:46Victor MerckléVictor MerckléScore: 27,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:4727,313142,184,623132,818,0001,019,0002,117,632stderr
2Aug 25, 2026 15:4727,372142,483,461133,032,0001,095,0002,117,632stderr
3Aug 25, 2026 15:4727,373142,490,386133,036,0001,093,0002,117,632stderr
4Aug 25, 2026 15:4727,383142,563,108133,083,0001,095,0002,117,632stderr
5Aug 25, 2026 15:4727,386142,566,099133,110,0001,084,0002,117,632stderr
6Aug 25, 2026 15:4727,393142,671,291133,088,0001,142,0002,117,632stderr
7Aug 25, 2026 15:4727,399142,654,232133,164,0001,095,0002,117,632stderr
8Aug 25, 2026 15:4727,405142,724,289133,189,0001,098,0002,117,632stderr
9Aug 25, 2026 15:4727,429142,849,281133,306,0001,099,0002,117,632stderr