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 21:13Victor MerckléVictor MerckléScore: 26,851Success
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 21:1326,817139,831,821130,394,0001,012,0002,117,632stderr
2Sep 3, 2026 21:1326,835139,937,086130,399,0001,093,0002,117,632stderr
3Sep 3, 2026 21:1326,840140,075,332130,420,0001,099,0002,117,632stderr
4Sep 3, 2026 21:1326,845140,078,970130,452,0001,089,0002,117,632stderr
5Sep 3, 2026 21:1326,851140,108,038130,476,0001,095,0002,117,632stderr
6Sep 3, 2026 21:1326,862140,046,156130,527,0001,100,0002,117,632stderr
7Sep 3, 2026 21:1326,862140,061,661130,532,0001,092,0002,117,632stderr
8Sep 3, 2026 21:1326,865140,098,341130,470,0001,172,0002,117,632stderr
9Sep 3, 2026 21:1326,878140,123,681130,459,0001,245,0002,117,632stderr