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 14, 2026 20:17Pavel SkripkinPavel SkripkinScore: 769,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:17768,9473,795,623,3523,765,844,0001,998,0002,437,120
2Mar 14, 2026 20:17769,0533,794,383,8453,767,362,000999,0002,437,120
3Mar 14, 2026 20:17769,0913,793,336,1023,767,549,000999,0002,277,376
4Mar 14, 2026 20:17769,1503,794,003,0823,766,838,0001,998,0002,277,376
5Mar 14, 2026 20:17769,1683,792,745,8923,766,925,0001,998,0002,273,280
6Mar 14, 2026 20:17769,8233,798,080,0313,769,137,0002,998,0002,277,376
7Mar 14, 2026 20:17776,2463,833,633,3553,802,608,000999,0002,277,376
8Mar 14, 2026 20:17778,7463,842,953,6163,814,858,000999,0002,277,376
9Mar 14, 2026 20:17778,8203,841,517,0013,815,217,000999,0002,437,120