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:52anboto1anboto1Score: 67,643Success
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 20:5467,422338,894,743329,260,0001,109,0002,113,536
2Aug 3, 2026 20:5467,425339,380,363329,297,0001,089,0002,113,536
3Aug 3, 2026 20:5467,441339,571,098329,299,0001,163,0002,113,536
4Aug 3, 2026 20:5467,464339,643,527329,494,0001,084,0002,113,536
5Aug 3, 2026 20:5467,643340,511,504330,363,0001,089,0002,113,536
6Aug 3, 2026 20:5468,968346,931,017336,860,0001,084,0002,113,536
7Aug 3, 2026 20:5469,021347,298,086337,106,0001,098,0002,113,536
8Aug 3, 2026 20:5469,103347,789,893337,418,0001,188,0002,113,536
9Aug 3, 2026 20:5469,534352,708,576339,601,0001,117,0002,113,536