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 listAug 3, 2026 22:16anboto1anboto1Score: 57,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:1657,197289,355,206279,161,0001,107,0002,113,536
2Aug 3, 2026 22:1657,211288,543,299279,245,0001,090,0002,113,536
3Aug 3, 2026 22:1657,217288,943,943279,142,0001,224,0002,113,536
4Aug 3, 2026 22:1657,347290,054,471279,911,0001,090,0002,113,536
5Aug 3, 2026 22:1657,660291,616,538281,370,0001,166,0002,113,536
6Aug 3, 2026 22:1658,061293,611,725283,414,0001,086,0002,113,536
7Aug 3, 2026 22:1658,077293,762,165283,444,0001,134,0002,113,536
8Aug 3, 2026 22:1658,818297,672,624287,082,0001,129,0002,113,536
9Aug 3, 2026 22:1658,845296,791,321287,251,0001,094,0002,113,536