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:56Victor MerckléVictor MerckléScore: 25,934Success
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:5625,927135,490,116125,957,0001,090,0002,117,632stderr
2Sep 2, 2026 13:5625,928135,516,144125,952,0001,098,0002,117,632stderr
3Sep 2, 2026 13:5625,930135,440,377125,966,0001,092,0002,117,632stderr
4Sep 2, 2026 13:5625,931135,232,157125,958,0001,104,0002,117,632stderr
5Sep 2, 2026 13:5625,934135,606,884125,970,0001,110,0002,117,632stderr
6Sep 2, 2026 13:5625,938135,535,069126,005,0001,094,0002,117,632stderr
7Sep 2, 2026 13:5625,941137,237,489126,016,0001,099,0002,117,632stderr
8Sep 2, 2026 13:5625,945135,550,272126,039,0001,094,0002,117,632stderr
9Sep 2, 2026 13:5625,958135,701,655126,032,0001,163,0002,117,632stderr