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 29, 2026 01:50Josu San MartinJosu San MartinScore: 24,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:5024,209127,644,980117,621,0001,005,0002,113,536
2Aug 29, 2026 01:5024,209127,029,503117,616,0001,009,0002,113,536
3Aug 29, 2026 01:5024,213128,300,929117,638,0001,009,0002,113,536
4Aug 29, 2026 01:5024,239127,803,414117,658,0001,115,0002,113,536
5Aug 29, 2026 01:5024,260127,259,587117,859,0001,018,0002,113,536
6Aug 29, 2026 01:5024,266127,365,866117,626,0001,278,0002,113,536
7Aug 29, 2026 01:5024,514128,498,540119,115,0001,008,0002,113,536
8Aug 29, 2026 01:5024,522128,613,203119,157,0001,005,0002,113,536
9Aug 29, 2026 01:5030,055156,000,542146,001,0001,269,0002,113,536