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 15:50Victor MerckléVictor MerckléScore: 27,433Success
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 15:5027,395142,630,515133,215,0001,023,0002,117,632stderr
2Aug 25, 2026 15:5027,400142,675,916133,176,0001,084,0002,117,632stderr
3Aug 25, 2026 15:5027,416142,745,516133,246,0001,093,0002,117,632stderr
4Aug 25, 2026 15:5027,428142,759,361133,294,0001,106,0002,117,632stderr
5Aug 25, 2026 15:5027,433142,831,271133,328,0001,098,0002,117,632stderr
6Aug 25, 2026 15:5027,444142,847,690133,365,0001,115,0002,117,632stderr
7Aug 25, 2026 15:5027,444142,886,873133,368,0001,108,0002,117,632stderr
8Aug 25, 2026 15:5027,464142,995,606133,477,0001,100,0002,117,632stderr
9Aug 25, 2026 15:5027,467142,950,792133,500,0001,093,0002,117,632stderr