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 listJul 4, 2026 00:32Victor MerckléVictor MerckléScore: 47,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:3347,593241,143,411231,198,0002,008,0002,117,632stderr
2Jul 4, 2026 00:3347,594241,164,017231,159,0002,056,0002,117,632stderr
3Jul 4, 2026 00:3347,607241,279,531231,213,0002,065,0002,117,632stderr
4Jul 4, 2026 00:3347,629241,327,471231,352,0002,034,0002,117,632stderr
5Jul 4, 2026 00:3347,722241,603,695231,733,0002,106,0002,117,632stderr
6Jul 4, 2026 00:3347,741241,848,895231,916,0002,016,0002,117,632stderr
7Jul 4, 2026 00:3347,775242,021,782232,023,0002,079,0002,117,632stderr
8Jul 4, 2026 00:3348,312244,655,169234,716,0002,014,0002,117,632stderr
9Jul 4, 2026 00:3348,380245,252,647234,941,0002,121,0002,117,632stderr