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 13:26Petsku01Petsku01Score: 736,586Success
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 12:39736,0763,642,758,1173,367,920,000238,852,0002,281,472
2Jan 12, 2026 13:26736,1253,631,976,2923,365,148,000241,866,0002,367,488
3Jan 12, 2026 12:39736,4593,638,030,0693,370,804,000237,845,0002,310,144
4Jan 12, 2026 13:26736,5863,638,261,0063,367,389,000241,884,0002,510,848
5Jan 12, 2026 12:39736,6533,633,241,7433,372,756,000236,842,0002,281,472
6Jan 12, 2026 13:26736,9293,648,211,2873,370,091,000240,863,0002,269,184