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 21:54anboto1anboto1Score: 128,525Success
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 21:57127,955637,217,058625,630,0001,354,0002,113,536
2Jul 31, 2026 21:57127,984637,404,030625,756,0001,370,0002,113,536
3Jul 31, 2026 21:57128,283639,012,863627,215,0001,373,0002,113,536
4Jul 31, 2026 21:57128,359639,213,376627,591,0001,371,0002,113,536
5Jul 31, 2026 21:57128,525640,071,169628,413,0001,364,0002,113,536
6Jul 31, 2026 21:57128,614640,348,288628,120,0002,089,0002,113,536
7Jul 31, 2026 21:57130,221648,305,309636,711,0001,374,0002,113,536
8Jul 31, 2026 21:57130,283648,770,596637,017,0001,370,0002,113,536
9Jul 31, 2026 21:57130,495649,602,940638,071,0001,355,0002,113,536