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 00:53Victor MerckléVictor MerckléScore: 27,950Success
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 00:5327,905145,148,176135,712,0001,025,0002,117,632stderr
2Sep 2, 2026 00:5327,910145,255,308135,735,0001,028,0002,117,632stderr
3Sep 2, 2026 00:5327,914145,199,058135,740,0001,040,0002,117,632stderr
4Sep 2, 2026 00:5327,941146,181,966135,807,0001,107,0002,117,632stderr
5Sep 2, 2026 00:5327,950145,343,258135,856,0001,102,0002,117,632stderr
6Sep 2, 2026 00:5327,951145,367,117135,860,0001,101,0002,117,632stderr
7Sep 2, 2026 00:5327,959145,696,138135,855,0001,148,0002,117,632stderr
8Sep 2, 2026 00:5327,967146,127,067135,939,0001,103,0002,117,632stderr
9Sep 2, 2026 00:5327,983145,502,552136,028,0001,089,0002,117,632stderr