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 listJan 12, 2026 11:41Petsku01Petsku01Score: 450,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 11:41449,1772,228,584,6511,966,079,000234,890,0002,285,568
2Jan 12, 2026 11:41449,9012,232,527,6521,963,678,000240,837,0002,506,752
3Jan 12, 2026 11:41450,0652,231,607,4711,970,497,000234,820,0002,359,296
4Jan 12, 2026 11:41450,1192,229,800,2911,972,733,000232,850,0002,273,280
5Jan 12, 2026 11:41450,1942,233,456,3331,968,173,000237,779,0002,473,984
6Jan 12, 2026 11:41450,2282,239,865,4331,962,214,000243,902,0002,609,152
7Jan 12, 2026 11:41450,2782,240,523,8061,961,544,000244,818,0002,285,568
8Jan 12, 2026 11:41450,3622,233,209,6681,961,912,000244,864,0002,523,136
9Jan 12, 2026 11:41450,4772,236,667,0781,966,520,000240,818,0002,363,392