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 18:16anboto1anboto1Score: 154,296Success
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 18:17154,040764,725,379753,727,0001,071,0002,113,536
2Jul 31, 2026 18:17154,048765,952,681753,759,0001,081,0002,113,536
3Jul 31, 2026 18:17154,204765,610,983754,503,0001,097,0002,113,536
4Jul 31, 2026 18:17154,227765,668,432754,649,0001,068,0002,113,536
5Jul 31, 2026 18:17154,296766,783,237754,972,0001,082,0002,113,536
6Jul 31, 2026 18:17154,487767,022,301755,918,0001,071,0002,113,536
7Jul 31, 2026 18:17154,551767,673,639756,235,0001,069,0002,113,536
8Jul 31, 2026 18:17154,584767,371,259756,386,0001,076,0002,113,536
9Jul 31, 2026 18:17154,707768,855,095756,995,0001,072,0002,113,536