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 15:40wnwnScore: 101,222Success
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 15:41101,160504,271,485493,650,0002,034,0002,113,536
2May 11, 2026 15:41101,177503,823,776493,739,0002,031,0002,113,536
3May 11, 2026 15:41101,220504,095,395494,974,0001,004,0002,113,536
4May 11, 2026 15:41101,222505,237,521494,985,0001,004,0002,113,536
5May 11, 2026 15:41101,222503,890,976494,984,0001,005,0002,113,536
6May 11, 2026 15:41101,240505,383,713494,071,0002,005,0002,113,536
7May 11, 2026 15:41101,245506,368,460495,099,0001,004,0002,113,536
8May 11, 2026 15:41101,669505,534,000497,177,0001,004,0002,113,536
9May 11, 2026 15:41101,700507,560,663496,304,0002,030,0002,113,536