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 24, 2026 18:31Victor MerckléVictor MerckléScore: 30,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:3229,840154,602,761145,211,0001,009,0002,117,632stderr
2Aug 24, 2026 18:3229,885154,771,141145,433,0001,008,0002,117,632stderr
3Aug 24, 2026 18:3230,190156,762,502145,915,0002,016,0002,117,632stderr
4Aug 24, 2026 18:3230,398157,271,551146,936,0002,015,0002,117,632stderr
5Aug 24, 2026 18:3230,536158,016,921148,619,0001,010,0002,117,632stderr
6Aug 24, 2026 18:3230,670161,784,698148,226,0002,059,0002,117,632stderr
7Aug 24, 2026 18:3230,731159,544,994148,500,0002,082,0002,117,632stderr
8Aug 24, 2026 18:3230,872163,805,908149,216,0002,060,0002,117,632stderr
9Aug 24, 2026 18:3231,038162,726,299149,061,0003,027,0002,117,632stderr