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 24, 2026 18:06Victor MerckléVictor MerckléScore: 31,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:0831,575163,097,614153,712,0001,010,0002,117,632stderr
2Aug 24, 2026 18:0831,640163,446,454154,031,0001,008,0002,117,632stderr
3Aug 24, 2026 18:0831,669163,905,970153,164,0002,017,0002,117,632stderr
4Aug 24, 2026 18:0831,750163,948,757154,566,0001,011,0002,117,632stderr
5Aug 24, 2026 18:0831,780164,130,456154,710,0001,012,0002,117,632stderr
6Aug 24, 2026 18:0831,802164,219,212154,823,0001,011,0002,117,632stderr
7Aug 24, 2026 18:0832,017169,933,840154,794,0002,094,0002,117,632stderr
8Aug 24, 2026 18:0832,449168,815,300156,886,0002,115,0002,117,632stderr
9Aug 24, 2026 18:0833,102175,415,299158,144,0004,057,0002,117,632stderr