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:47Kevin HeaveyKevin HeaveyScore: 53,185Success
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:1152,655268,111,493246,507,00011,506,00020,480
2Jul 27, 2026 14:1152,665268,860,427246,618,00011,441,00020,480
3Jul 27, 2026 14:1152,674268,210,147246,694,00011,411,00020,480
4Jul 27, 2026 14:1153,181270,652,354246,379,00014,210,00020,480
5Jul 27, 2026 14:1153,185270,714,952247,081,00013,526,00020,480
6Jul 27, 2026 14:1153,186270,758,168246,534,00014,080,00020,480
7Jul 27, 2026 14:1153,217270,895,915246,576,00014,192,00020,480
8Jul 27, 2026 14:1153,226271,032,029246,449,00014,359,00020,480
9Jul 27, 2026 14:1157,257291,308,713266,498,00014,066,00020,480