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 21, 2025 19:16Aniruddha DebAniruddha DebScore: 186,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 19:16183,952925,055,119901,363,00002,531,328
2Aug 21, 2025 19:16183,987922,100,322900,538,000999,0002,428,928
3Aug 21, 2025 19:16186,256933,314,154911,653,000999,0002,531,328
4Aug 21, 2025 19:16186,587934,100,848913,276,000999,0002,416,640
5Aug 21, 2025 19:16186,946944,883,566916,036,00002,428,928
6Aug 21, 2025 19:16187,128936,635,192914,930,0001,999,0002,531,328
7Aug 21, 2025 19:16187,843944,126,601918,433,0001,998,0002,420,736
8Aug 21, 2025 19:16188,324944,600,872921,787,000999,0002,531,328
9Aug 21, 2025 19:16188,416948,973,381922,238,000999,0002,531,328