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:40Kevin HeaveyKevin HeaveyScore: 53,716Success
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:0153,380271,624,416251,018,00010,545,00020,480
2Jul 27, 2026 14:0153,510272,306,927250,272,00011,928,00020,480
3Jul 27, 2026 14:0153,575272,590,540249,186,00013,335,0002,113,536
4Jul 27, 2026 14:0153,576273,362,906251,252,00011,271,00020,480
5Jul 27, 2026 14:0153,716273,351,083251,454,00011,757,0002,113,536
6Jul 27, 2026 14:0153,974274,626,931251,053,00013,424,0002,113,536
7Jul 27, 2026 14:0154,035274,909,603251,040,00013,732,00020,480
8Jul 27, 2026 14:0154,149275,448,986251,092,00014,241,00020,480
9Jul 27, 2026 14:0154,503277,095,521254,693,00012,376,00020,480