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 2, 2026 13:53Victor MerckléVictor MerckléScore: 25,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 13:5325,871135,334,467125,680,0001,091,0002,117,632stderr
2Sep 2, 2026 13:5325,877135,230,547125,787,0001,012,0002,117,632stderr
3Sep 2, 2026 13:5325,879135,284,802125,684,0001,124,0002,117,632stderr
4Sep 2, 2026 13:5325,892135,275,309125,782,0001,090,0002,117,632stderr
5Sep 2, 2026 13:5325,895136,517,666125,783,0001,106,0002,117,632stderr
6Sep 2, 2026 13:5325,896135,309,671125,803,0001,090,0002,117,632stderr
7Sep 2, 2026 13:5325,896135,363,402125,795,0001,098,0002,117,632stderr
8Sep 2, 2026 13:5325,907135,341,279125,849,0001,096,0002,117,632stderr
9Sep 2, 2026 13:5325,912135,330,020125,871,0001,099,0002,117,632stderr