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 listMar 15, 2026 09:32limanjun99limanjun99Score: 217,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 09:32217,3321,092,340,0521,062,927,0001,999,0002,289,664
2Mar 15, 2026 09:32217,3391,090,055,8241,062,963,0001,999,0002,269,184
3Mar 15, 2026 09:32217,3951,095,113,5881,063,238,0001,998,0002,289,664
4Mar 15, 2026 09:32217,4331,093,004,9091,063,424,0001,998,0002,289,664
5Mar 15, 2026 09:32217,5771,097,598,3861,065,127,000999,0002,269,184
6Mar 15, 2026 09:32217,5841,095,755,4001,064,162,0002,000,0002,289,664
7Mar 15, 2026 09:32219,1221,100,289,8371,070,697,0002,999,0002,265,088
8Mar 15, 2026 09:32219,1891,100,134,9051,071,029,0002,997,0002,392,064
9Mar 15, 2026 09:32219,3511,099,373,9881,071,821,0002,999,0002,289,664