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:35wnwnScore: 111,519Success
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:36111,422557,694,631543,928,0002,043,0002,113,536
2May 11, 2026 10:36111,461556,287,776544,130,0002,032,0002,113,536
3May 11, 2026 10:36111,498556,808,268544,242,0002,102,0002,113,536
4May 11, 2026 10:36111,516555,149,210544,372,0002,059,0002,113,536
5May 11, 2026 10:36111,519558,203,073544,299,0002,147,0002,113,536
6May 11, 2026 10:36111,623555,733,634544,927,0002,027,0002,113,536
7May 11, 2026 10:36111,635557,777,813544,913,0002,103,0002,113,536
8May 11, 2026 10:36111,658557,361,914545,069,0002,060,0002,113,536
9May 11, 2026 10:36111,938557,951,639545,491,0003,009,0002,113,536