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 listJul 31, 2026 17:41anboto1anboto1Score: 465,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:42464,9362,288,391,8282,276,188,0002,003,0002,113,536
2Jul 31, 2026 17:42464,9452,288,529,0532,275,982,0002,249,0002,113,536
3Jul 31, 2026 17:42464,9882,289,145,0262,275,365,0003,080,0002,113,536
4Jul 31, 2026 17:42465,1052,289,306,4782,276,774,0002,245,0002,113,536
5Jul 31, 2026 17:42465,2262,290,566,0912,277,481,0002,129,0002,113,536
6Jul 31, 2026 17:42465,2342,289,908,8072,277,622,0002,026,0002,113,536
7Jul 31, 2026 17:42465,2472,290,092,8232,277,708,0002,004,0002,113,536
8Jul 31, 2026 17:42465,2652,290,327,3672,276,790,0003,011,0002,113,536
9Jul 31, 2026 17:42465,2662,290,140,0492,277,802,0002,004,0002,113,536