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:35wnwnScore: 135,589Success
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:35134,288668,578,184655,907,0002,108,0002,113,536
2May 11, 2026 10:35134,322667,396,976655,969,0002,211,0002,113,536
3May 11, 2026 10:35134,326667,640,701655,964,0002,234,0002,113,536
4May 11, 2026 10:35135,164671,677,312660,135,0002,171,0002,113,536
5May 11, 2026 10:35135,589673,846,864662,169,0002,220,0002,113,536
6May 11, 2026 10:35135,644683,362,772662,608,0002,052,0002,113,536
7May 11, 2026 10:35139,067691,334,386679,333,0002,100,0002,113,536
8May 11, 2026 10:35139,072691,345,211679,364,0002,090,0002,113,536
9May 11, 2026 10:35140,001696,586,641683,964,0002,043,0002,113,536