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 14, 2026 09:05Haha ExpertHaha ExpertScore: 401,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 09:06400,9521,974,945,1101,963,665,0001,004,0002,113,536
2Sep 14, 2026 09:06401,0231,975,327,4611,963,999,0001,015,0002,113,536
3Sep 14, 2026 09:06401,0251,975,354,7631,964,019,0001,004,0002,113,536
4Sep 14, 2026 09:06401,0531,975,455,8871,964,145,0001,017,0002,113,536
5Sep 14, 2026 09:06401,0751,975,620,7461,964,250,0001,021,0002,113,536
6Sep 14, 2026 09:06401,1141,975,969,2301,964,457,0001,003,0002,113,536
7Sep 14, 2026 09:06401,1351,975,856,5481,964,555,0001,007,0002,113,536
8Sep 14, 2026 09:06401,1851,976,113,8171,964,806,0001,001,0002,113,536
9Sep 14, 2026 09:06401,2971,977,811,3411,964,349,0002,011,0002,113,536