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:07Victor MerckléVictor MerckléScore: 27,404Success
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:0727,339142,338,588132,942,0001,021,0002,117,632stderr
2Aug 25, 2026 16:0727,355142,451,500132,999,0001,041,0002,117,632stderr
3Aug 25, 2026 16:0727,356142,374,180133,026,0001,019,0002,117,632stderr
4Aug 25, 2026 16:0727,396142,751,407133,142,0001,100,0002,117,632stderr
5Aug 25, 2026 16:0727,404142,704,584133,190,0001,094,0002,117,632stderr
6Aug 25, 2026 16:0727,408142,648,159133,205,0001,099,0002,117,632stderr
7Aug 25, 2026 16:0727,438142,927,892133,319,0001,131,0002,117,632stderr
8Aug 25, 2026 16:0727,444142,842,538133,391,0001,088,0002,117,632stderr
9Aug 25, 2026 16:0727,447142,914,977133,406,0001,088,0002,117,632stderr