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 2, 2026 07:56A_ShamanA_ShamanScore: 166,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:57166,551826,596,106812,096,0004,004,0002,125,824
2Jul 2, 2026 07:57166,566826,465,992812,169,0004,008,0002,125,824
3Jul 2, 2026 07:57166,598827,096,655812,331,0004,003,0002,125,824
4Jul 2, 2026 07:57166,620827,209,790812,433,0004,007,0002,125,824
5Jul 2, 2026 07:57166,650826,813,228812,580,0004,008,0002,125,824
6Jul 2, 2026 07:57166,651827,335,700812,589,0004,005,0002,125,824
7Jul 2, 2026 07:57166,682827,415,427812,739,0004,005,0002,125,824
8Jul 2, 2026 07:57166,704827,548,695812,847,0004,005,0002,125,824
9Jul 2, 2026 07:57166,940828,707,553814,003,0004,003,0002,125,824