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 09:01Petsku01Petsku01Score: 468,512Success
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 09:01468,3252,317,684,6122,057,918,000236,875,0002,281,472
2Jan 12, 2026 09:01468,3622,325,124,4972,050,086,000244,890,0002,306,048
3Jan 12, 2026 09:01468,4472,325,217,3682,053,560,000241,830,0002,277,376
4Jan 12, 2026 09:01468,4832,329,704,9692,044,725,000250,843,0002,375,680
5Jan 12, 2026 09:01468,5122,322,699,5842,054,847,000240,864,0002,379,776
6Jan 12, 2026 09:01468,7562,325,841,7442,055,022,000241,884,0002,379,776
7Jan 12, 2026 09:01468,9132,322,811,0692,059,810,000237,862,0002,281,472
8Jan 12, 2026 09:01469,4572,331,110,8912,054,517,000245,822,0002,387,968
9Jan 12, 2026 09:01470,5022,335,176,5062,063,621,000241,838,0002,322,432