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:32Kevin HeaveyKevin HeaveyScore: 53,228Success
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:4552,883269,297,350249,479,0009,651,00020,480
2Jul 27, 2026 13:4552,987269,769,265249,467,00010,172,00020,480
3Jul 27, 2026 13:4553,117270,340,974249,486,00010,789,00020,480
4Jul 27, 2026 13:4553,164272,974,967249,096,00011,410,00020,480
5Jul 27, 2026 13:4553,228271,554,917249,066,00011,753,00020,480
6Jul 27, 2026 13:4553,316271,392,385248,853,00012,400,00020,480
7Jul 27, 2026 13:4553,324272,072,341249,124,00012,165,00020,480
8Jul 27, 2026 13:4553,363271,737,239249,186,00012,293,00020,480
9Jul 27, 2026 13:4553,477272,206,465249,479,00012,560,00020,480