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 27, 2026 12:45Kevin HeaveyKevin HeaveyScore: 58,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:5058,104294,818,228274,821,0009,889,00020,480
2Jul 27, 2026 12:5058,352295,949,380276,202,0009,723,00020,480
3Jul 27, 2026 12:5058,587297,081,980276,064,00011,017,00020,480
4Jul 27, 2026 12:5058,664298,241,103276,081,00011,375,00020,480
5Jul 27, 2026 12:5058,666297,516,427276,047,00011,421,00020,480
6Jul 27, 2026 12:5058,725297,847,302276,136,00011,619,00020,480
7Jul 27, 2026 12:5060,467306,254,463285,356,00010,934,00020,480
8Jul 27, 2026 12:5061,628312,024,866291,893,00010,088,0002,113,536
9Jul 27, 2026 12:5063,060319,396,060297,551,00011,445,00020,480