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 listMay 11, 2026 15:27Victor MerckléVictor MerckléScore: 164,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:28163,928815,118,465801,029,0002,221,0002,113,536
2May 11, 2026 15:28164,093814,826,167800,000,0004,060,0002,113,536
3May 11, 2026 15:28164,193814,427,224802,330,0002,219,0002,113,536
4May 11, 2026 15:28164,210813,471,821802,483,0002,146,0002,113,536
5May 11, 2026 15:28164,303816,799,417802,827,0002,260,0002,113,536
6May 11, 2026 15:28164,973817,189,424806,368,0002,004,0002,113,536
7May 11, 2026 15:28166,573826,686,860813,881,0002,327,0002,113,536
8May 11, 2026 15:28166,850827,098,384815,512,0002,057,0002,113,536
9May 11, 2026 15:28167,135830,966,183816,724,0002,239,0002,113,536