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:10Kevin HeaveyKevin HeaveyScore: 57,390Success
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 13:2756,834291,105,497269,426,0009,061,0002,113,536
2Jul 27, 2026 13:2757,072289,509,868269,328,00010,329,00020,480
3Jul 27, 2026 13:2757,122289,810,484269,167,00010,734,00020,480
4Jul 27, 2026 13:2757,318290,710,441269,129,00011,730,00020,480
5Jul 27, 2026 13:2757,390291,089,631269,439,00011,776,0002,113,536
6Jul 27, 2026 13:2757,431291,336,456269,744,00011,672,0002,113,536
7Jul 27, 2026 13:2757,466291,508,797269,105,00012,480,00020,480
8Jul 27, 2026 13:2757,580292,073,295269,342,00012,801,00020,480
9Jul 27, 2026 13:2762,017313,709,998292,120,00011,765,00020,480