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 1, 2026 04:38anboto1anboto1Score: 208,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 04:39207,8721,028,805,6891,017,435,0001,138,0002,113,536
2Aug 1, 2026 04:39207,9151,028,910,5351,017,647,0001,137,0002,113,536
3Aug 1, 2026 04:39208,3131,031,118,4001,019,572,0001,162,0002,113,536
4Aug 1, 2026 04:39208,3451,032,393,3241,019,729,0001,164,0002,113,536
5Aug 1, 2026 04:39208,3701,031,214,6081,019,865,0001,148,0002,113,536
6Aug 1, 2026 04:39208,4081,031,374,7331,020,054,0001,148,0002,113,536
7Aug 1, 2026 04:39208,4241,031,604,4771,020,120,0001,161,0002,113,536
8Aug 1, 2026 04:39208,4651,031,770,4981,020,311,0001,172,0002,113,536
9Aug 1, 2026 04:39208,4691,031,774,6801,020,326,0001,173,0002,113,536