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:09anboto1anboto1Score: 162,487Success
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:10162,210805,709,935793,595,0001,234,0002,113,536
2Jul 31, 2026 19:10162,228805,812,572793,676,0001,243,0002,113,536
3Jul 31, 2026 19:10162,409806,164,411794,561,0001,247,0002,113,536
4Jul 31, 2026 19:10162,478807,084,065794,891,0001,255,0002,113,536
5Jul 31, 2026 19:10162,487806,399,789794,945,0001,244,0002,113,536
6Jul 31, 2026 19:10162,529807,049,029793,142,0003,253,0002,113,536
7Jul 31, 2026 19:10162,535807,345,710794,149,0002,277,0002,113,536
8Jul 31, 2026 19:10162,706807,487,846796,004,0001,257,0002,113,536
9Jul 31, 2026 19:10162,780807,860,146796,391,0001,235,0002,113,536