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 11, 2026 16:56olliecrowolliecrowScore: 93,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 16:5693,681485,085,433457,035,0002,000,0002,383,872
2Mar 11, 2026 16:5693,718482,080,548459,218,00002,277,376
3Mar 11, 2026 16:5693,721491,312,796458,231,0001,000,0002,277,376
4Mar 11, 2026 16:5693,726480,021,465459,255,00002,535,424
5Mar 11, 2026 16:5693,744487,783,193458,345,0001,000,0002,375,680
6Mar 11, 2026 16:5693,755491,147,833458,403,000998,0002,379,776
7Mar 11, 2026 16:5693,766487,096,601457,458,0001,997,0002,277,376
8Mar 11, 2026 16:5693,776485,530,823458,505,000998,0002,277,376
9Mar 11, 2026 16:5693,789482,933,532457,568,0001,998,0002,277,376