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 21, 2025 19:12Aniruddha DebAniruddha DebScore: 185,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 19:12182,860919,776,471895,014,0001,000,0002,523,136
2Aug 21, 2025 19:12183,727923,628,660898,262,0001,998,0002,420,736
3Aug 21, 2025 19:12184,325928,704,883902,193,000999,0002,531,328
4Aug 21, 2025 19:12184,655924,489,806903,811,000999,0002,510,848
5Aug 21, 2025 19:12185,206931,713,118906,509,000999,0002,514,944
6Aug 21, 2025 19:12185,986939,182,190910,330,000999,0002,424,832
7Aug 21, 2025 19:12186,012931,140,322910,462,000999,0002,420,736
8Aug 21, 2025 19:12187,641943,747,006917,444,0001,998,0002,531,328
9Aug 21, 2025 19:12188,631946,487,413923,294,000999,0002,531,328