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 04:45Josu San MartinJosu San MartinScore: 32,694Success
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 04:4532,665169,156,940158,793,0001,269,0002,113,536
2Aug 3, 2026 04:4532,666169,075,229158,801,0001,264,0002,113,536
3Aug 3, 2026 04:4532,688169,156,783159,115,0001,058,0002,113,536
4Aug 3, 2026 04:4532,691169,290,225158,918,0001,271,0002,113,536
5Aug 3, 2026 04:4532,694169,276,119159,178,0001,025,0002,113,536
6Aug 3, 2026 04:4532,737169,505,854159,343,0001,070,0002,113,536
7Aug 3, 2026 04:4532,769169,730,737159,291,0001,279,0002,113,536
8Aug 3, 2026 04:4532,797171,200,174159,443,0001,263,0002,113,536
9Aug 3, 2026 04:4533,373172,652,069162,274,0001,256,0002,113,536