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 31, 2026 21:36anboto1anboto1Score: 136,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:36134,813671,421,685659,231,0001,355,0002,113,536
2Jul 31, 2026 21:36135,670675,016,773663,421,0001,364,0002,113,536
3Jul 31, 2026 21:36135,956677,295,591664,782,0001,407,0002,113,536
4Jul 31, 2026 21:36136,191677,503,568665,988,0001,352,0002,113,536
5Jul 31, 2026 21:36136,544679,301,497667,703,0001,367,0002,113,536
6Jul 31, 2026 21:36136,546679,299,872667,727,0001,351,0002,113,536
7Jul 31, 2026 21:36137,440683,567,113672,101,0001,356,0002,113,536
8Jul 31, 2026 21:36137,691685,658,767673,320,0001,369,0002,113,536
9Jul 31, 2026 21:36140,150697,576,836685,378,0001,361,0002,113,536