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 listAug 3, 2026 20:22anboto1anboto1Score: 76,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:2376,007381,472,205371,338,0001,099,0002,113,536
2Aug 3, 2026 20:2376,022381,648,642371,422,0001,090,0002,113,536
3Aug 3, 2026 20:2376,030380,697,234371,460,0001,091,0002,113,536
4Aug 3, 2026 20:2376,033381,603,214371,480,0001,086,0002,113,536
5Aug 3, 2026 20:2376,033381,678,425371,474,0001,092,0002,113,536
6Aug 3, 2026 20:2376,721385,059,626374,834,0001,100,0002,113,536
7Aug 3, 2026 20:2376,740384,508,371374,828,0001,200,0002,113,536
8Aug 3, 2026 20:2376,777385,312,182375,107,0001,105,0002,113,536
9Aug 3, 2026 20:2376,782384,728,036375,132,0001,100,0002,113,536