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 5, 2026 20:36Victor MerckléVictor MerckléScore: 36,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:3735,894183,918,945174,874,0001,007,0002,117,632stderr
2Jul 5, 2026 20:3735,957184,233,859175,187,0001,007,0002,117,632stderr
3Jul 5, 2026 20:3736,612187,480,563178,394,0001,006,0002,117,632stderr
4Jul 5, 2026 20:3736,695187,899,653178,802,0001,007,0002,117,632stderr
5Jul 5, 2026 20:3736,701187,703,761178,829,0001,006,0002,117,632stderr
6Jul 5, 2026 20:3736,747187,890,265179,054,0001,007,0002,117,632stderr
7Jul 5, 2026 20:3736,768188,372,792179,161,0001,007,0002,117,632stderr
8Jul 5, 2026 20:3736,954189,137,021180,069,0001,007,0002,117,632stderr
9Jul 5, 2026 20:3736,966189,239,914180,131,0001,007,0002,117,632stderr