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:16anboto1anboto1Score: 179,504Success
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:16179,116887,680,377876,566,0001,107,0002,113,536
2Jul 31, 2026 19:16179,149887,940,513875,665,0002,167,0002,113,536
3Jul 31, 2026 19:16179,149887,725,647876,720,0001,111,0002,113,536
4Jul 31, 2026 19:16179,351888,833,668877,566,0001,254,0002,113,536
5Jul 31, 2026 19:16179,504889,697,293878,451,0001,123,0002,113,536
6Jul 31, 2026 19:16179,746890,689,216879,654,0001,103,0002,113,536
7Jul 31, 2026 19:16180,950896,652,162885,548,0001,107,0002,113,536
8Jul 31, 2026 19:16181,058897,182,956886,073,0001,112,0002,113,536
9Jul 31, 2026 19:16181,374898,711,585887,633,0001,102,0002,113,536