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:58Victor MerckléVictor MerckléScore: 26,300Success
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 02:0126,187136,721,920127,307,0001,013,0002,117,632stderr
2Sep 2, 2026 02:0126,222136,950,877127,403,0001,089,0002,117,632stderr
3Sep 2, 2026 02:0126,223137,528,224127,462,0001,032,0002,117,632stderr
4Sep 2, 2026 02:0126,288137,242,733127,712,0001,101,0002,117,632stderr
5Sep 2, 2026 02:0126,300137,955,705127,779,0001,093,0002,117,632stderr
6Sep 2, 2026 02:0126,323137,441,011127,900,0001,085,0002,117,632stderr
7Sep 2, 2026 02:0126,325137,435,446127,896,0001,099,0002,117,632stderr
8Sep 2, 2026 02:0126,367137,598,023128,052,0001,151,0002,117,632stderr
9Sep 2, 2026 02:0126,396137,632,771128,085,0001,260,0002,117,632stderr