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 09:40wnwnScore: 103,785Success
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 09:43103,374515,181,409505,530,0001,005,0002,113,536
2May 11, 2026 09:43103,417515,455,041504,735,0002,010,0002,113,536
3May 11, 2026 09:43103,512515,937,347506,208,0001,004,0002,113,536
4May 11, 2026 09:43103,516515,932,941506,228,0001,003,0002,113,536
5May 11, 2026 09:43103,785517,837,071507,546,0001,005,0002,113,536
6May 11, 2026 09:43104,285519,614,888508,936,0002,063,0002,113,536
7May 11, 2026 09:43105,458526,241,557515,742,0001,005,0002,113,536
8May 11, 2026 09:43106,451531,566,191519,564,0002,050,0002,113,536
9May 11, 2026 09:43106,937533,413,708521,945,0002,047,0002,113,536