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:50anboto1anboto1Score: 156,608Success
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:50156,417776,536,963765,373,0001,073,0002,113,536
2Jul 31, 2026 18:50156,545777,090,687766,002,0001,069,0002,113,536
3Jul 31, 2026 18:50156,577777,359,016766,147,0001,085,0002,113,536
4Jul 31, 2026 18:50156,598777,863,319766,272,0001,062,0002,113,536
5Jul 31, 2026 18:50156,608777,415,318766,312,0001,069,0002,113,536
6Jul 31, 2026 18:50156,661777,678,104766,569,0001,071,0002,113,536
7Jul 31, 2026 18:50156,661778,148,531766,569,0001,073,0002,113,536
8Jul 31, 2026 18:50157,035779,447,371768,393,0001,082,0002,113,536
9Jul 31, 2026 18:50157,074779,664,933768,597,0001,070,0002,113,536