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 8, 2026 16:17SneedSneedScore: 954,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 16:17954,6344,704,450,0654,675,706,0001,999,0002,535,424
2Mar 8, 2026 16:17954,6444,706,798,9794,674,759,0002,998,0002,277,376
3Mar 8, 2026 16:17954,7734,710,595,5544,677,391,000999,0002,277,376
4Mar 8, 2026 16:17954,8144,706,553,1294,676,589,0001,998,0002,531,328
5Mar 8, 2026 16:17954,8164,713,099,8184,676,598,0001,998,0002,277,376
6Mar 8, 2026 16:17954,9234,708,650,4624,677,124,0001,998,0002,285,568
7Mar 8, 2026 16:17954,9904,709,723,6954,676,455,0002,998,0002,277,376
8Mar 8, 2026 16:17955,0194,710,847,2524,678,596,000999,0002,285,568
9Mar 8, 2026 16:17955,0464,708,203,9944,679,723,00002,523,136