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 02:03Victor MerckléVictor MerckléScore: 27,959Success
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 02:0427,909145,203,007135,747,0001,011,0002,117,632stderr
2Aug 25, 2026 02:0427,932145,768,984134,837,0002,034,0002,117,632stderr
3Aug 25, 2026 02:0427,943145,409,817135,913,0001,010,0002,117,632stderr
4Aug 25, 2026 02:0427,957145,422,785134,977,0002,013,0002,117,632stderr
5Aug 25, 2026 02:0427,959145,389,967134,945,0002,058,0002,117,632stderr
6Aug 25, 2026 02:0428,021145,714,115135,293,0002,012,0002,117,632stderr
7Aug 25, 2026 02:0428,058145,951,587135,455,0002,031,0002,117,632stderr
8Aug 25, 2026 02:0428,102146,153,239135,692,0002,010,0002,117,632stderr
9Aug 25, 2026 02:0428,391147,554,747137,078,0002,040,0002,117,632stderr