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 1, 2026 00:46anboto1anboto1Score: 139,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 00:47139,255692,475,476681,237,0001,117,0002,113,536
2Aug 1, 2026 00:47139,259692,551,243681,249,0001,124,0002,113,536
3Aug 1, 2026 00:47139,312693,189,581681,505,0001,125,0002,113,536
4Aug 1, 2026 00:47139,352692,987,492681,695,0001,132,0002,113,536
5Aug 1, 2026 00:47139,355692,940,965681,726,0001,116,0002,113,536
6Aug 1, 2026 00:47139,365693,072,523681,771,0001,119,0002,113,536
7Aug 1, 2026 00:47139,367693,784,934681,766,0001,136,0002,113,536
8Aug 1, 2026 00:47139,410693,252,407681,996,0001,115,0002,113,536
9Aug 1, 2026 00:47139,484693,971,892682,356,0001,117,0002,113,536