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 listJan 20, 2026 04:09Josu San MartinJosu San MartinScore: 211,826Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 04:12208,7081,048,049,4861,013,674,0008,997,0002,482,176
2Jan 20, 2026 04:12209,6121,057,542,0121,020,104,0006,993,0002,281,472
3Jan 20, 2026 04:09210,7891,057,289,3791,024,870,0007,998,0002,375,680
4Jan 20, 2026 04:12211,8261,069,753,8931,031,955,0005,993,0002,367,488
5Jan 20, 2026 04:09212,1911,066,056,1051,032,744,0006,991,0002,281,472
6Jan 20, 2026 04:09214,2741,076,034,5281,041,953,0007,991,0002,351,104