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 listJan 12, 2026 11:32Petsku01Petsku01Score: 476,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 11:32476,0592,360,609,7632,099,822,000232,869,0002,383,872
2Jan 12, 2026 11:32476,1392,362,710,9602,104,271,000228,812,0002,383,872
3Jan 12, 2026 11:32476,4672,356,787,7112,096,820,000237,866,0002,379,776
4Jan 12, 2026 11:32476,9812,367,291,4742,093,394,000243,812,0002,383,872
5Jan 12, 2026 11:32477,2352,372,152,4352,099,611,000238,842,0002,281,472
6Jan 12, 2026 11:32477,3482,366,764,4662,091,216,000247,788,0002,281,472