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 01:43Victor MerckléVictor MerckléScore: 26,971Success
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 01:4426,890140,341,522130,710,0001,052,0002,117,632stderr
2Sep 2, 2026 01:4426,892140,234,667130,746,0001,027,0002,117,632stderr
3Sep 2, 2026 01:4426,921140,356,937130,866,0001,048,0002,117,632stderr
4Sep 2, 2026 01:4426,948140,494,272130,968,0001,081,0002,117,632stderr
5Sep 2, 2026 01:4426,971140,598,929131,131,0001,029,0002,117,632stderr
6Sep 2, 2026 01:4426,974140,659,519131,071,0001,103,0002,117,632stderr
7Sep 2, 2026 01:4427,098141,194,487131,747,0001,038,0002,117,632stderr
8Sep 2, 2026 01:4427,111141,308,376131,756,0001,089,0002,117,632stderr
9Sep 2, 2026 01:4427,192141,724,575132,132,0001,111,0002,117,632stderr