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 21:15anboto1anboto1Score: 57,580Success
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 21:1657,550291,134,109280,900,0001,098,0002,113,536
2Aug 3, 2026 21:1657,562290,571,313280,938,0001,120,0002,113,536
3Aug 3, 2026 21:1657,563291,245,041280,961,0001,099,0002,113,536
4Aug 3, 2026 21:1657,566291,073,727280,988,0001,086,0002,113,536
5Aug 3, 2026 21:1657,580291,151,701281,048,0001,097,0002,113,536
6Aug 3, 2026 21:1657,600290,936,204281,074,0001,167,0002,113,536
7Aug 3, 2026 21:1657,627291,484,043281,291,0001,084,0002,113,536
8Aug 3, 2026 21:1657,684291,704,965281,535,0001,120,0002,113,536
9Aug 3, 2026 21:1659,112298,120,597288,553,0001,097,0002,113,536