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:47wnwnScore: 99,026Success
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:4898,462491,237,654480,429,0002,036,0002,113,536
2May 11, 2026 10:4898,543494,315,127480,842,0002,020,0002,113,536
3May 11, 2026 10:4898,562491,731,638480,847,0002,108,0002,113,536
4May 11, 2026 10:4898,588492,389,767481,070,0002,014,0002,113,536
5May 11, 2026 10:4899,026494,543,912483,186,0002,042,0002,113,536
6May 11, 2026 10:4899,042495,813,597483,243,0002,064,0002,117,632
7May 11, 2026 10:4899,050494,139,942483,272,0002,076,0002,113,536
8May 11, 2026 10:4899,073494,193,525483,454,0002,006,0002,113,536
9May 11, 2026 10:4899,232495,872,903484,221,0002,019,0002,113,536