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 18, 2026 01:35M-RochatM-RochatScore: 110,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:37110,556552,394,599540,569,0001,156,0002,113,536
2May 18, 2026 01:37110,557551,075,389540,537,0001,194,0002,113,536
3May 18, 2026 01:37110,596552,049,999540,776,0001,148,0002,113,536
4May 18, 2026 01:37110,598554,425,277540,780,0001,154,0002,113,536
5May 18, 2026 01:37110,716552,052,906541,335,0001,176,0002,113,536
6May 18, 2026 01:37113,871570,013,334556,790,0001,182,0002,113,536
7May 18, 2026 01:37114,032571,048,678557,609,0001,152,0002,113,536
8May 18, 2026 01:37114,304570,535,978558,925,0001,166,0002,113,536
9May 18, 2026 01:37114,364571,898,533559,217,0001,167,0002,113,536