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 08:01wnwnScore: 106,310Success
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 08:03106,241529,247,435517,469,0003,112,0002,113,536
2May 11, 2026 08:03106,265529,404,485517,602,0003,097,0002,113,536
3May 11, 2026 08:03106,274530,184,603517,587,0003,160,0002,113,536
4May 11, 2026 08:03106,307530,764,091517,704,0003,201,0002,113,536
5May 11, 2026 08:03106,310531,458,741517,911,0003,009,0002,113,536
6May 11, 2026 08:03106,792532,345,040520,020,0003,262,0002,113,536
7May 11, 2026 08:03109,701549,390,124534,525,0003,011,0002,113,536
8May 11, 2026 08:03109,739548,386,970534,650,0003,074,0002,113,536
9May 11, 2026 08:03113,802566,965,282554,378,0003,256,0002,113,536