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 15:32Josu San MartinJosu San MartinScore: 25,342Success
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 15:3225,304132,459,077122,727,0001,266,0002,113,536
2Aug 4, 2026 15:3225,305133,046,888122,746,0001,249,0002,113,536
3Aug 4, 2026 15:3225,316133,058,857122,799,0001,252,0002,113,536
4Aug 4, 2026 15:3225,323133,055,972123,043,0001,042,0002,113,536
5Aug 4, 2026 15:3225,342132,666,886122,926,0001,250,0002,113,536
6Aug 4, 2026 15:3225,411133,091,121123,252,0001,263,0002,113,536
7Aug 4, 2026 15:3225,534133,498,750123,868,0001,252,0002,113,536
8Aug 4, 2026 15:3225,536134,134,518123,876,0001,255,0002,113,536
9Aug 4, 2026 15:3225,562134,306,008123,989,0001,269,0002,113,536