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 14:07Kevin HeaveyKevin HeaveyScore: 51,460Success
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:3351,007260,548,053240,924,0009,015,00020,480
2Jul 27, 2026 14:3351,066260,466,386240,839,0009,388,00020,480
3Jul 27, 2026 14:3351,075261,168,962241,022,0009,246,0002,113,536
4Jul 27, 2026 14:3351,371261,730,835241,250,00010,468,00020,480
5Jul 27, 2026 14:3351,460262,290,005240,807,00011,349,00020,480
6Jul 27, 2026 14:3351,475262,311,783241,660,00010,568,00020,480
7Jul 27, 2026 14:3351,480262,732,044242,477,0009,777,00020,480
8Jul 27, 2026 14:3351,581263,510,376240,791,00011,957,0002,113,536
9Jul 27, 2026 14:3351,775263,865,338241,010,00012,688,00020,480