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 1, 2026 20:19CodeReclaimersCodeReclaimersScore: 1,189,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 20:201,189,0465,836,668,8615,825,215,0001,112,0002,113,536
2Aug 1, 2026 20:201,189,0945,837,521,6715,825,452,0001,112,0002,113,536
3Aug 1, 2026 20:201,189,1525,838,033,0845,824,643,0002,206,0002,113,536