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,510Success
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:0398,419491,534,440480,202,0002,055,0002,113,536
2May 11, 2026 11:0398,436494,830,091480,256,0002,085,0002,113,536
3May 11, 2026 11:0398,481493,028,020480,493,0002,067,0002,113,536
4May 11, 2026 11:0398,499491,394,881480,585,0002,063,0002,113,536
5May 11, 2026 11:0398,510492,029,829480,632,0002,067,0002,113,536
6May 11, 2026 11:0398,978496,191,370482,904,0002,090,0002,113,536
7May 11, 2026 11:0398,992495,962,077483,054,0002,007,0002,113,536
8May 11, 2026 11:0399,114495,077,645483,652,0002,008,0002,113,536
9May 11, 2026 11:03102,368512,219,828500,601,0001,004,0002,113,536