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 4, 2026 11:52Josu San MartinJosu San MartinScore: 25,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 11:5225,425133,026,569123,326,0001,260,0002,113,536
2Aug 4, 2026 11:5225,448133,029,782123,437,0001,262,0002,113,536
3Aug 4, 2026 11:5225,467133,232,465123,621,0001,169,0002,113,536
4Aug 4, 2026 11:5225,484133,276,060123,611,0001,261,0002,113,536
5Aug 4, 2026 11:5225,486133,290,440123,851,0001,035,0002,113,536
6Aug 4, 2026 11:5225,495137,313,984123,740,0001,188,0002,113,536
7Aug 4, 2026 11:5225,501133,461,465123,701,0001,256,0002,113,536
8Aug 4, 2026 11:5225,619134,005,351124,267,0001,270,0002,113,536
9Aug 4, 2026 11:5225,623133,993,767124,289,0001,268,0002,113,536