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 05:26Victor MerckléVictor MerckléScore: 26,896Success
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 05:2626,886140,134,968130,718,0001,025,0002,117,632stderr
2Sep 2, 2026 05:2626,891140,257,827130,682,0001,084,0002,117,632stderr
3Sep 2, 2026 05:2626,893140,298,303130,693,0001,086,0002,117,632stderr
4Sep 2, 2026 05:2626,895140,283,281130,688,0001,099,0002,117,632stderr
5Sep 2, 2026 05:2626,896140,759,436130,678,0001,116,0002,117,632stderr
6Sep 2, 2026 05:2626,898140,184,534130,714,0001,090,0002,117,632stderr
7Sep 2, 2026 05:2626,898140,233,338130,702,0001,099,0002,117,632stderr
8Sep 2, 2026 05:2626,903140,300,035130,710,0001,117,0002,117,632stderr
9Sep 2, 2026 05:2626,903140,278,352130,707,0001,119,0002,117,632stderr