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:59anboto1anboto1Score: 57,995Success
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:0157,532290,372,722280,768,0001,142,0002,113,536
2Aug 3, 2026 21:0157,542290,502,698280,792,0001,166,0002,113,536
3Aug 3, 2026 21:0157,641291,004,711281,211,0001,231,0002,113,536
4Aug 3, 2026 21:0157,648290,969,841281,293,0001,187,0002,113,536
5Aug 3, 2026 21:0157,995292,626,043283,051,0001,126,0002,113,536
6Aug 3, 2026 21:0158,256295,269,193284,232,0001,224,0002,113,536
7Aug 3, 2026 21:0158,736296,251,152286,692,0001,117,0002,113,536
8Aug 3, 2026 21:0158,915297,166,114287,569,0001,119,0002,113,536
9Aug 3, 2026 21:0159,124298,146,168288,563,0001,148,0002,113,536