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 21:48anboto1anboto1Score: 148,343Success
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 21:49147,094730,629,296719,586,0001,175,0002,113,536
2Jul 31, 2026 21:49147,753734,040,269722,765,0001,225,0002,113,536
3Jul 31, 2026 21:49147,851734,617,751723,283,0001,189,0002,113,536
4Jul 31, 2026 21:49147,994735,366,983723,964,0001,208,0002,113,536
5Jul 31, 2026 21:49148,343736,917,865725,700,0001,184,0002,113,536
6Jul 31, 2026 21:49149,496742,452,990731,358,0001,176,0002,113,536
7Jul 31, 2026 21:49149,828744,157,685732,964,0001,196,0002,113,536
8Jul 31, 2026 21:49150,459747,269,184736,063,0001,187,0002,113,536
9Jul 31, 2026 21:49151,288751,302,134740,125,0001,191,0002,113,536