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 18:01anboto1anboto1Score: 150,170Success
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 18:02149,953744,632,963733,686,0001,084,0002,113,536
2Jul 31, 2026 18:02150,007745,734,684733,947,0001,090,0002,113,536
3Jul 31, 2026 18:02150,054745,251,365734,201,0001,068,0002,113,536
4Jul 31, 2026 18:02150,118745,607,121734,500,0001,083,0002,113,536
5Jul 31, 2026 18:02150,170746,592,444733,704,0002,133,0002,113,536
6Jul 31, 2026 18:02150,215746,825,284734,978,0001,080,0002,113,536
7Jul 31, 2026 18:02150,223748,452,972735,012,0001,082,0002,113,536
8Jul 31, 2026 18:02150,291746,326,561735,349,0001,078,0002,113,536
9Jul 31, 2026 18:02150,359746,809,688735,692,0001,070,0002,113,536