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: 56,290Success
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 12:5955,741283,184,669262,760,00010,372,00020,480
2Jul 27, 2026 12:5955,989285,179,730263,446,00010,903,00020,480
3Jul 27, 2026 12:5956,133285,880,083264,197,00010,855,00020,480
4Jul 27, 2026 12:5956,217285,471,981262,776,00012,689,00020,480
5Jul 27, 2026 12:5956,290285,853,882263,261,00012,561,00020,480
6Jul 27, 2026 12:5956,325286,048,179263,582,00012,414,00020,480
7Jul 27, 2026 12:5956,375286,346,313264,030,00012,210,00020,480
8Jul 27, 2026 12:5956,447287,327,208264,161,00012,430,00020,480
9Jul 27, 2026 12:5956,501287,552,643264,131,00012,725,00020,480