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 listAug 25, 2026 06:42Victor MerckléVictor MerckléScore: 30,025Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 06:4329,989155,327,354144,924,0002,026,0002,117,632stderr
2Aug 25, 2026 06:4330,004155,490,686144,994,0002,027,0002,117,632stderr
3Aug 25, 2026 06:4330,014155,431,531145,057,0002,012,0002,117,632stderr
4Aug 25, 2026 06:4330,020155,522,589145,078,0002,024,0002,117,632stderr
5Aug 25, 2026 06:4330,025155,485,523146,112,0001,011,0002,117,632stderr
6Aug 25, 2026 06:4330,025155,533,553145,118,0002,006,0002,117,632stderr
7Aug 25, 2026 06:4330,033155,518,968145,155,0002,008,0002,117,632stderr
8Aug 25, 2026 06:4330,044155,587,968145,163,0002,053,0002,117,632stderr
9Aug 25, 2026 06:4330,067155,734,421145,308,0002,025,0002,117,632stderr