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 30, 2025 15:20zielajzielajScore: 24,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2025 02:1924,278147,063,846116,962,0001,999,0002,314,240
2Jul 30, 2025 15:2024,279139,252,727117,967,000999,0002,461,696
3Jul 29, 2025 02:1924,289146,682,226117,014,0002,000,0002,465,792
4Jul 30, 2025 15:2024,303146,753,051116,082,0003,002,0002,461,696
5Jul 30, 2025 15:2025,338147,991,168121,153,0003,003,0002,453,504
6Jul 29, 2025 02:1926,077154,004,014126,778,000998,0002,334,720