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 20:44Josu San MartinJosu San MartinScore: 39,461Success
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 20:4539,167202,789,853190,810,0001,112,0002,113,536
2Jul 31, 2026 20:4539,456203,415,258192,224,0001,111,0002,113,536
3Jul 31, 2026 20:4539,457204,191,919192,220,0001,124,0002,113,536
4Jul 31, 2026 20:4539,459203,437,108192,242,0001,109,0002,113,536
5Jul 31, 2026 20:4539,461203,519,841192,242,0001,121,0002,113,536
6Jul 31, 2026 20:4539,465203,662,700192,254,0001,126,0002,113,536
7Jul 31, 2026 20:4539,465203,510,543192,254,0001,126,0002,113,536
8Jul 31, 2026 20:4539,468203,570,036192,282,0001,115,0002,113,536
9Jul 31, 2026 20:4539,475203,462,567192,303,0001,125,0002,113,536