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:42anboto1anboto1Score: 281,967Success
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:43281,9481,391,807,1741,379,543,0002,004,0002,113,536
2Jul 31, 2026 17:43281,9501,391,771,2981,379,551,0002,006,0002,113,536
3Jul 31, 2026 17:43281,9571,391,720,5141,379,587,0002,003,0002,113,536
4Jul 31, 2026 17:43281,9631,391,675,4651,379,617,0002,002,0002,113,536
5Jul 31, 2026 17:43281,9671,391,780,2161,378,606,0003,035,0002,113,536
6Jul 31, 2026 17:43281,9821,391,816,1171,379,710,0002,005,0002,113,536
7Jul 31, 2026 17:43281,9961,391,977,3561,379,779,0002,004,0002,113,536
8Jul 31, 2026 17:43282,0261,391,898,2781,379,928,0002,003,0002,113,536
9Jul 31, 2026 17:43282,0601,392,059,7821,380,089,0002,006,0002,113,536