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 9, 2026 23:03Victor MerckléVictor MerckléScore: 29,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:0429,565154,691,077143,863,0001,009,0002,117,632stderr
2Jul 9, 2026 23:0429,603153,004,375143,044,0002,013,0002,117,632stderr
3Jul 9, 2026 23:0429,633153,083,080143,188,0002,018,0002,117,632stderr
4Jul 9, 2026 23:0429,662153,167,967143,333,0002,013,0002,117,632stderr
5Jul 9, 2026 23:0429,705153,363,605143,515,0002,041,0002,117,632stderr
6Jul 9, 2026 23:0429,716153,463,167143,588,0002,024,0002,117,632stderr
7Jul 9, 2026 23:0429,837154,072,031145,195,0001,010,0002,117,632stderr
8Jul 9, 2026 23:0429,929154,488,384145,647,0001,009,0002,117,632stderr
9Jul 9, 2026 23:0430,066155,383,642145,279,0002,046,0002,117,632stderr