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 listFeb 13, 2026 17:49olliecrowolliecrowScore: 102,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 17:49102,610528,311,360500,789,0001,999,0002,322,432
2Feb 13, 2026 17:49102,621533,869,893500,844,0001,999,0002,277,376
3Feb 13, 2026 17:49102,624534,332,983501,860,000999,0002,277,376
4Feb 13, 2026 17:49102,673531,170,436502,096,0001,000,0002,330,624
5Feb 13, 2026 17:49102,676524,722,227502,113,0001,000,0002,277,376
6Feb 13, 2026 17:49102,706524,182,422502,259,0001,000,0002,277,376
7Feb 13, 2026 17:49102,851528,195,767502,971,000999,0002,277,376
8Feb 13, 2026 17:49102,860527,209,844503,014,0001,000,0002,277,376
9Feb 13, 2026 17:49102,879530,279,781503,105,0001,000,0002,277,376