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 listSep 22, 2025 15:41Tejas G.Tejas G.Score: 2,906,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2025 15:412,899,58214,244,916,91414,083,021,000124,929,0002,277,376
2Sep 22, 2025 15:412,906,92314,276,894,26614,108,000,000135,922,0002,277,376
3Sep 22, 2025 15:413,079,54415,123,302,63914,967,832,000121,933,0002,277,376