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 08:09A_ShamanA_ShamanScore: 138,308Success
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 08:09138,280687,625,899673,572,0004,003,0002,146,304
2Jul 2, 2026 08:09138,285687,563,186673,587,0004,014,0002,146,304
3Jul 2, 2026 08:09138,287687,796,878673,613,0003,996,0002,146,304
4Jul 2, 2026 08:09138,307688,156,346673,710,0003,998,0002,146,304
5Jul 2, 2026 08:09138,308688,201,648673,710,0004,003,0002,146,304
6Jul 2, 2026 08:09138,320688,186,673673,773,0003,996,0002,146,304
7Jul 2, 2026 08:09138,330688,397,192673,824,0003,995,0002,146,304
8Jul 2, 2026 08:09138,331688,406,526673,827,0003,995,0002,146,304
9Jul 2, 2026 08:09138,346688,080,213673,903,0003,994,0002,146,304