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:22Kevin HeaveyKevin HeaveyScore: 53,455Success
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:3252,914281,572,084249,463,0009,816,00020,480
2Jul 27, 2026 13:3252,949269,471,868249,243,00010,209,00020,480
3Jul 27, 2026 13:3253,194272,346,987249,236,00011,419,00020,480
4Jul 27, 2026 13:3253,392271,754,294249,079,00012,543,00020,480
5Jul 27, 2026 13:3253,455272,692,514249,139,00012,793,00020,480
6Jul 27, 2026 13:3253,473272,012,937249,216,00012,806,00020,480
7Jul 27, 2026 13:3253,508272,378,175249,218,00012,976,0002,113,536
8Jul 27, 2026 13:3253,552273,144,449249,378,00013,027,0002,113,536
9Jul 27, 2026 13:3253,585272,622,473249,065,00013,503,00020,480