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 31, 2026 19:13anboto1anboto1Score: 158,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:14157,834784,503,348771,107,0002,281,0002,113,536
2Jul 31, 2026 19:14158,217785,658,441774,009,0001,259,0002,113,536
3Jul 31, 2026 19:14158,233786,494,385774,088,0001,254,0002,113,536
4Jul 31, 2026 19:14158,237785,648,660774,133,0001,229,0002,113,536
5Jul 31, 2026 19:14158,361786,851,154774,710,0001,260,0002,113,536
6Jul 31, 2026 19:14158,368786,120,910774,768,0001,238,0002,113,536
7Jul 31, 2026 19:14158,419786,426,169775,025,0001,230,0002,113,536
8Jul 31, 2026 19:14158,670787,759,896776,236,0001,249,0002,113,536
9Jul 31, 2026 19:14158,725787,818,216776,499,0001,255,0002,113,536