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 2, 2026 22:29anboto1anboto1Score: 60,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:3059,750304,062,973291,655,0001,123,0002,113,536
2Aug 2, 2026 22:3059,754302,848,220291,673,0001,123,0002,113,536
3Aug 2, 2026 22:3059,911306,753,768292,442,0001,123,0002,113,536
4Aug 2, 2026 22:3060,013304,126,795292,944,0001,122,0002,113,536
5Aug 2, 2026 22:3060,071305,164,458293,225,0001,123,0002,113,536
6Aug 2, 2026 22:3060,703307,544,854296,336,0001,111,0002,113,536
7Aug 2, 2026 22:3060,731308,319,627296,453,0001,133,0002,113,536
8Aug 2, 2026 22:3061,270310,322,058299,109,0001,117,0002,113,536
9Aug 2, 2026 22:3061,369310,659,975299,587,0001,123,0002,113,536