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:36wnwnScore: 104,692Success
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:38101,427506,384,314495,992,0001,004,0002,113,536
2May 11, 2026 10:38102,051510,740,010499,049,0001,005,0002,113,536
3May 11, 2026 10:38102,175509,337,697499,657,0001,005,0002,113,536
4May 11, 2026 10:38102,878514,413,712503,100,0001,004,0002,113,536
5May 11, 2026 10:38104,692521,819,515510,979,0002,012,0002,113,536
6May 11, 2026 10:38104,740524,542,524511,215,0002,012,0002,113,536
7May 11, 2026 10:38104,808524,865,763512,559,0001,004,0002,113,536
8May 11, 2026 10:38104,812524,479,471511,544,0002,039,0002,113,536
9May 11, 2026 10:38105,361525,387,600515,266,0001,004,0002,113,536