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 1, 2026 22:51Victor MerckléVictor MerckléScore: 54,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:5554,395274,206,934264,527,0002,012,0002,117,632stderr
2Jul 1, 2026 22:5554,425274,579,149264,577,0002,110,0002,117,632stderr
3Jul 1, 2026 22:5554,430274,575,224264,577,0002,132,0002,117,632stderr
4Jul 1, 2026 22:5554,439274,654,706264,610,0002,143,0002,117,632stderr
5Jul 1, 2026 22:5554,439274,618,425264,653,0002,101,0002,117,632stderr
6Jul 1, 2026 22:5554,454274,786,363264,805,0002,023,0002,117,632stderr
7Jul 1, 2026 22:5554,463274,774,823264,842,0002,031,0002,117,632stderr
8Jul 1, 2026 22:5554,586275,434,493265,462,0002,011,0002,117,632stderr
9Jul 1, 2026 22:5554,726276,068,140266,025,0002,137,0002,117,632stderr