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 10:18wnwnScore: 98,823Success
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 10:1998,752492,682,357481,826,0002,060,0002,113,536
2May 11, 2026 10:1998,761503,797,594481,909,0002,024,0002,113,536
3May 11, 2026 10:1998,806492,923,472482,114,0002,036,0002,113,536
4May 11, 2026 10:1998,817492,945,853483,203,0001,004,0002,113,536
5May 11, 2026 10:1998,823493,320,255482,230,0002,006,0002,113,536
6May 11, 2026 10:1998,881494,111,015482,471,0002,050,0002,113,536
7May 11, 2026 10:1999,304497,339,329485,585,0001,005,0002,113,536
8May 11, 2026 10:1999,391496,219,018484,931,0002,088,0002,113,536
9May 11, 2026 10:1999,410497,987,075485,106,0002,005,0002,113,536