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:30wnwnScore: 107,050Success
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:31106,535531,807,183519,990,0002,034,0002,113,536
2May 11, 2026 10:31106,619531,162,495520,391,0002,046,0002,113,536
3May 11, 2026 10:31106,639532,979,852520,491,0002,042,0002,113,536
4May 11, 2026 10:31107,018543,093,193522,387,0002,006,0002,113,536
5May 11, 2026 10:31107,050535,835,873521,533,0003,016,0002,113,536
6May 11, 2026 10:31110,433549,851,549539,101,0002,023,0002,113,536
7May 11, 2026 10:31110,443552,866,169539,145,0002,026,0002,113,536
8May 11, 2026 10:31110,473553,539,430539,273,0002,045,0002,113,536
9May 11, 2026 10:31110,513550,312,850539,469,0002,046,0002,113,536