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 3, 2026 04:19Victor MerckléVictor MerckléScore: 29,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 04:2029,033150,772,687140,229,0002,034,0002,117,632stderr
2Aug 3, 2026 04:2029,057151,503,397140,363,0002,021,0002,117,632stderr
3Aug 3, 2026 04:2029,117150,896,024140,603,0002,075,0002,117,632stderr
4Aug 3, 2026 04:2029,129151,882,351140,713,0002,022,0002,117,632stderr
5Aug 3, 2026 04:2029,221151,437,792141,159,0002,028,0002,117,632stderr
6Aug 3, 2026 04:2029,265151,766,347141,393,0002,007,0002,117,632stderr
7Aug 3, 2026 04:2029,326152,490,175142,688,0001,010,0002,117,632stderr
8Aug 3, 2026 04:2029,349152,271,636142,804,0001,009,0002,117,632stderr
9Aug 3, 2026 04:2029,516153,110,909143,619,0001,010,0002,117,632stderr