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 listNov 11, 2025 22:44izotoffizotoffScore: 565,892Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 22:44565,7672,803,764,8942,770,261,0001,998,0002,437,120
2Nov 11, 2025 22:44565,7842,798,055,0692,770,343,0001,998,0002,326,528
3Nov 11, 2025 22:44565,8582,804,279,2972,770,706,0001,998,0002,326,528
4Nov 11, 2025 22:44565,8612,807,062,9852,768,722,0003,998,0002,326,528
5Nov 11, 2025 22:44565,8922,795,581,8182,770,873,0001,999,0002,326,528
6Nov 11, 2025 22:44566,0002,799,910,4672,769,402,0003,997,0002,326,528
7Nov 11, 2025 22:44566,0232,808,268,2492,771,516,0001,998,0002,330,624
8Nov 11, 2025 22:44566,0342,799,147,8702,770,570,0002,998,0002,326,528
9Nov 11, 2025 22:44566,3642,804,246,8882,771,189,0003,997,0002,326,528