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 18, 2025 19:53Aniruddha DebAniruddha DebScore: 192,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 19:53189,988957,209,695930,943,00002,269,184
2Aug 18, 2025 19:53190,023959,715,467931,111,00002,269,184
3Aug 18, 2025 19:53190,248956,871,902932,217,00002,531,328
4Aug 18, 2025 19:53191,097960,607,416935,377,000999,0002,531,328
5Aug 18, 2025 19:53192,200967,099,865940,782,000999,0002,269,184
6Aug 18, 2025 19:53192,832969,605,207943,876,000999,0002,269,184
7Aug 18, 2025 19:53193,777976,892,417948,510,000999,0002,269,184
8Aug 18, 2025 19:53193,960985,253,745949,403,000999,0002,416,640
9Aug 18, 2025 19:53194,550984,653,072952,297,000999,0002,424,832