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 7, 2026 17:02Victor MerckléVictor MerckléScore: 32,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:0332,383166,498,355157,670,0001,009,00024,576stderr
2Jul 7, 2026 17:0332,475167,073,940158,122,0001,010,00024,576stderr
3Jul 7, 2026 17:0332,486167,044,716158,175,0001,010,00024,576stderr
4Jul 7, 2026 17:0332,495167,038,272158,218,0001,011,00024,576stderr
5Jul 7, 2026 17:0332,502167,125,096158,256,0001,008,00024,576stderr
6Jul 7, 2026 17:0332,530167,235,176158,391,0001,009,00024,576stderr
7Jul 7, 2026 17:0332,542167,343,349158,447,0001,010,00024,576stderr
8Jul 7, 2026 17:0332,655167,917,009159,006,0001,007,00024,576stderr
9Jul 7, 2026 17:0332,939169,212,055160,397,0001,008,0002,117,632stderr