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:50Haha ExpertHaha ExpertScore: 233,261Success
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:50231,3951,144,341,3831,017,395,000116,444,00020,480
2Sep 11, 2026 14:50231,4371,144,397,2101,018,102,000115,944,00020,480
3Sep 11, 2026 14:50231,6161,145,586,9491,017,230,000117,691,00020,480
4Sep 11, 2026 14:50231,7061,147,122,7861,018,819,000116,545,00020,480
5Sep 11, 2026 14:50233,2611,153,444,3851,023,313,000119,666,00020,480
6Sep 11, 2026 14:50234,0331,157,296,7071,028,285,000118,481,00020,480
7Sep 11, 2026 14:50234,5011,159,817,3021,031,112,000117,944,00020,480
8Sep 11, 2026 14:50235,0081,161,940,1161,032,185,000119,355,00020,480
9Sep 11, 2026 14:50235,2041,162,881,7401,033,692,000118,811,00020,480