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 07:47wnwnScore: 108,004Success
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 07:48107,727536,638,585524,713,0003,153,0002,113,536
2May 11, 2026 07:48107,731537,315,105524,874,0003,010,0002,113,536
3May 11, 2026 07:48107,734536,817,346524,620,0003,281,0002,113,536
4May 11, 2026 07:48107,771537,240,866525,054,0003,024,0002,113,536
5May 11, 2026 07:48108,004539,409,281526,212,0003,010,0002,113,536
6May 11, 2026 07:48108,265539,297,483527,306,0003,197,0002,113,536
7May 11, 2026 07:48111,120554,499,477541,479,0003,009,0002,113,536
8May 11, 2026 07:48114,337570,262,842557,016,0003,240,0002,113,536
9May 11, 2026 07:48114,379572,025,824557,219,0003,241,0002,113,536