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 listAug 3, 2026 20:53anboto1anboto1Score: 57,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5557,536290,342,799280,888,0001,041,0002,113,536
2Aug 3, 2026 20:5557,561290,558,331281,007,0001,044,0002,113,536
3Aug 3, 2026 20:5557,603290,709,721281,090,0001,167,0002,113,536
4Aug 3, 2026 20:5557,611291,431,837281,094,0001,201,0002,113,536
5Aug 3, 2026 20:5557,613291,353,924281,193,0001,115,0002,113,536
6Aug 3, 2026 20:5557,663291,589,892281,436,0001,116,0002,113,536
7Aug 3, 2026 20:5558,015293,489,853283,266,0001,010,0002,113,536
8Aug 3, 2026 20:5558,165294,108,236283,875,0001,134,0002,113,536
9Aug 3, 2026 20:5559,082298,619,745288,375,0001,129,0002,113,536