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 13:45Kevin HeaveyKevin HeaveyScore: 53,155Success
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 14:0952,847269,147,293247,292,00011,660,0002,113,536
2Jul 27, 2026 14:0952,849269,066,179247,178,00011,785,00020,480
3Jul 27, 2026 14:0952,895269,257,941247,064,00012,122,00020,480
4Jul 27, 2026 14:0953,145280,369,129246,987,00013,425,00020,480
5Jul 27, 2026 14:0953,155270,471,570247,022,00013,440,00020,480
6Jul 27, 2026 14:0953,200270,729,826247,099,00013,581,00020,480
7Jul 27, 2026 14:0953,202271,506,657246,955,00013,735,00020,480
8Jul 27, 2026 14:0953,246271,709,523246,990,00013,917,00020,480
9Jul 27, 2026 14:0955,002279,572,073255,507,00014,007,0002,113,536