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:05Victor MerckléVictor MerckléScore: 25,610Success
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:0525,577133,726,541124,309,0001,021,0002,117,632stderr
2Sep 3, 2026 21:0525,601133,841,151124,333,0001,112,0002,117,632stderr
3Sep 3, 2026 21:0525,602133,832,523124,345,0001,107,0002,117,632stderr
4Sep 3, 2026 21:0525,605133,948,899124,375,0001,094,0002,117,632stderr
5Sep 3, 2026 21:0525,610133,969,683124,382,0001,108,0002,117,632stderr
6Sep 3, 2026 21:0525,620134,056,887124,437,0001,104,0002,117,632stderr
7Sep 3, 2026 21:0525,635134,038,870124,521,0001,094,0002,117,632stderr
8Sep 3, 2026 21:0526,052136,101,333126,557,0001,098,0002,117,632stderr
9Sep 3, 2026 21:0526,077136,286,055126,580,0001,198,0002,117,632stderr