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 listMay 11, 2026 11:00wnwnScore: 98,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:0298,431491,587,051480,299,0002,017,0002,113,536
2May 11, 2026 11:0298,442492,830,321480,305,0002,063,0002,113,536
3May 11, 2026 11:0298,551491,750,159480,815,0002,088,0002,113,536
4May 11, 2026 11:0298,570493,627,575480,957,0002,040,0002,113,536
5May 11, 2026 11:0298,982494,030,695482,937,0002,075,0002,113,536
6May 11, 2026 11:0298,984494,479,914483,011,0002,013,0002,113,536
7May 11, 2026 11:0299,011495,486,193483,114,0002,041,0002,113,536
8May 11, 2026 11:0299,012495,158,022483,153,0002,006,0002,113,536
9May 11, 2026 11:0299,045496,912,066484,319,0001,005,0002,113,536