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:47Kevin HeaveyKevin HeaveyScore: 55,999Success
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:0155,602282,551,586262,417,00010,033,00020,480
2Jul 27, 2026 13:0155,828283,576,275262,245,00011,314,00020,480
3Jul 27, 2026 13:0155,836284,417,163263,049,00010,550,00020,480
4Jul 27, 2026 13:0155,975284,329,991263,578,00010,703,00020,480
5Jul 27, 2026 13:0155,999284,523,900262,403,00011,993,00020,480
6Jul 27, 2026 13:0156,055284,811,857262,336,00012,334,00020,480
7Jul 27, 2026 13:0156,131285,009,640263,445,00011,600,00020,480
8Jul 27, 2026 13:0156,359286,192,504263,666,00012,494,0002,113,536
9Jul 27, 2026 13:0157,355291,164,956269,016,00012,025,0002,113,536