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 listSep 11, 2026 15:23Haha ExpertHaha ExpertScore: 174,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 15:26173,937863,179,744819,728,00032,567,0002,113,536
2Sep 11, 2026 15:26173,937862,445,817820,043,00032,253,00020,480
3Sep 11, 2026 15:26174,008865,328,090819,549,00033,093,0002,113,536
4Sep 11, 2026 15:26174,054863,855,987819,853,00033,013,00020,480
5Sep 11, 2026 15:26174,162863,390,777819,311,00034,087,00020,480
6Sep 11, 2026 15:26174,397865,414,771819,669,00034,878,0002,113,536
7Sep 11, 2026 15:26174,402865,217,653819,869,00034,705,00020,480
8Sep 11, 2026 15:26174,560865,611,545820,148,00035,199,00020,480
9Sep 11, 2026 15:26174,698866,169,719819,946,00036,077,00020,480