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 listMar 28, 2026 16:05Dominique GarmierDominique GarmierScore: 1,564,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 14:541,554,2737,648,092,1217,613,941,0001,998,0002,473,984
2Mar 28, 2026 16:051,562,0087,686,435,3577,651,841,0001,998,0002,277,376
3Mar 28, 2026 14:541,563,5567,688,456,2557,660,423,000999,0002,465,792
4Mar 28, 2026 16:051,564,3397,702,103,7047,663,263,0001,998,0002,273,280
5Mar 28, 2026 14:541,567,1187,709,776,4117,676,879,0001,998,0002,273,280
6Mar 28, 2026 16:051,567,5647,711,375,7757,680,066,000999,0002,277,376