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 16:23Victor MerckléVictor MerckléScore: 27,280Success
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 16:2327,206141,742,664132,295,0001,018,0002,117,632stderr
2Aug 25, 2026 16:2327,257141,914,744132,539,0001,021,0002,117,632stderr
3Aug 25, 2026 16:2327,265142,030,583132,504,0001,097,0002,117,632stderr
4Aug 25, 2026 16:2327,277142,057,596132,560,0001,098,0002,117,632stderr
5Aug 25, 2026 16:2327,280142,241,883132,577,0001,095,0002,117,632stderr
6Aug 25, 2026 16:2327,295142,124,578132,655,0001,094,0002,117,632stderr
7Aug 25, 2026 16:2327,300142,554,200132,680,0001,093,0002,117,632stderr
8Aug 25, 2026 16:2327,343142,446,806132,852,0001,129,0002,117,632stderr
9Aug 25, 2026 16:2327,353142,504,999132,884,0001,147,0002,117,632stderr