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 10:30wnwnScore: 98,782Success
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 10:3298,646492,130,904481,328,0002,039,0002,113,536
2May 11, 2026 10:3298,723495,380,438481,732,0002,013,0002,113,536
3May 11, 2026 10:3298,728493,878,468481,715,0002,056,0002,113,536
4May 11, 2026 10:3298,780495,347,014481,962,0002,063,0002,113,536
5May 11, 2026 10:3298,782494,672,111481,949,0002,084,0002,113,536
6May 11, 2026 10:3299,089496,030,519483,468,0002,070,0002,113,536
7May 11, 2026 10:3299,287497,799,811484,428,0002,081,0002,113,536
8May 11, 2026 10:3299,336496,075,386484,715,0002,033,0002,113,536
9May 11, 2026 10:3299,340498,059,073484,710,0002,059,0002,113,536