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 00:02Josu San MartinJosu San MartinScore: 28,198Success
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 00:0228,136146,066,575136,865,0001,002,0002,113,536
2Aug 4, 2026 00:0228,159146,519,736136,713,0001,269,0002,113,536
3Aug 4, 2026 00:0228,161146,191,756136,716,0001,276,0002,113,536
4Aug 4, 2026 00:0228,177146,614,976137,021,0001,048,0002,113,536
5Aug 4, 2026 00:0228,198146,611,959137,021,0001,153,0002,113,536
6Aug 4, 2026 00:0228,201147,957,121136,914,0001,271,0002,113,536
7Aug 4, 2026 00:0228,232146,841,358137,075,0001,263,0002,113,536
8Aug 4, 2026 00:0228,582148,553,192138,796,0001,260,0002,113,536
9Aug 4, 2026 00:0228,596148,267,217139,098,0001,025,0002,113,536