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 listNov 11, 2025 13:58Yehor BondarYehor BondarScore: 681,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2025 13:58681,9133,369,712,9313,339,373,0001,999,0002,285,568
2Nov 11, 2025 13:58681,9593,367,529,9233,338,603,0002,997,0002,531,328
3Nov 11, 2025 13:58681,9683,372,262,1983,339,644,0001,998,0002,285,568
4Nov 11, 2025 13:58681,9683,369,172,6783,338,647,0002,998,0002,527,232
5Nov 11, 2025 13:58681,9883,374,248,5313,339,745,0001,998,0002,285,568
6Nov 11, 2025 13:58681,9913,368,937,5963,338,758,0002,997,0002,519,040
7Nov 11, 2025 13:58682,0213,365,819,7863,338,905,0002,998,0002,527,232
8Nov 11, 2025 13:58682,1203,364,245,1793,340,390,0001,999,0002,367,488
9Nov 11, 2025 13:58682,1513,370,188,9013,339,543,0002,997,0002,285,568