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:59anboto1anboto1Score: 179,790Success
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:59179,540890,069,782878,642,0001,105,0002,113,536
2Jul 31, 2026 18:59179,597889,964,644878,934,0001,095,0002,113,536
3Jul 31, 2026 18:59179,670890,364,334879,283,0001,100,0002,113,536
4Jul 31, 2026 18:59179,774890,949,515879,756,0001,139,0002,113,536
5Jul 31, 2026 18:59179,790891,079,613879,848,0001,123,0002,113,536
6Jul 31, 2026 18:59179,881891,347,406880,307,0001,110,0002,113,536
7Jul 31, 2026 18:59181,370898,713,002887,615,0001,102,0002,113,536
8Jul 31, 2026 18:59181,534899,451,438888,421,0001,096,0002,113,536
9Jul 31, 2026 18:59181,834901,134,081889,880,0001,109,0002,113,536