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 11, 2026 14:56Haha ExpertHaha ExpertScore: 166,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 14:57163,903813,369,247775,308,00027,818,00020,480
2Sep 11, 2026 14:57163,954813,848,407775,305,00028,072,00020,480
3Sep 11, 2026 14:57164,088814,428,064775,317,00028,716,00020,480
4Sep 11, 2026 14:57164,262815,236,819775,468,00029,419,00020,480
5Sep 11, 2026 14:57166,159824,517,768785,852,00028,331,00020,480
6Sep 11, 2026 14:57167,174829,778,593790,259,00028,898,0002,113,536
7Sep 11, 2026 14:57167,182829,576,393790,035,00029,160,00020,480
8Sep 11, 2026 14:57167,383830,748,119791,049,00029,132,00020,480
9Sep 11, 2026 14:57167,629831,776,031792,688,00028,695,00020,480