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 3, 2026 22:09Victor MerckléVictor MerckléScore: 25,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:1025,851135,176,260125,644,0001,029,0002,117,632stderr
2Sep 3, 2026 22:1025,866135,183,404125,713,0001,034,0002,117,632stderr
3Sep 3, 2026 22:1025,869135,184,557125,665,0001,096,0002,117,632stderr
4Sep 3, 2026 22:1025,877135,226,264125,709,0001,090,0002,117,632stderr
5Sep 3, 2026 22:1025,886136,616,715125,768,0001,075,0002,117,632stderr
6Sep 3, 2026 22:1025,893135,321,753125,778,0001,100,0002,117,632stderr
7Sep 3, 2026 22:1025,897135,367,036125,803,0001,097,0002,117,632stderr
8Sep 3, 2026 22:1025,898135,330,081125,799,0001,102,0002,117,632stderr
9Sep 3, 2026 22:1025,903135,295,355125,829,0001,097,0002,117,632stderr