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 listSep 24, 2026 16:26Andrew EpsteinAndrew EpsteinScore: 40,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 16:2740,327209,611,350196,469,0001,135,0002,113,536
2Sep 24, 2026 16:2740,343208,742,893196,570,0001,114,0002,113,536
3Sep 24, 2026 16:2740,358208,152,763196,633,0001,124,0002,113,536
4Sep 24, 2026 16:2740,366208,247,015196,691,0001,104,0002,113,536
5Sep 24, 2026 16:2740,387208,294,516196,768,0001,129,0002,113,536
6Sep 24, 2026 16:2740,395208,484,267196,741,0001,198,0002,113,536
7Sep 24, 2026 16:2740,404208,373,038196,860,0001,123,0002,113,536
8Sep 24, 2026 16:2740,440211,423,762196,996,0001,160,0002,113,536
9Sep 24, 2026 16:2741,927221,200,831204,197,0001,250,0002,113,536