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 2, 2026 23:39Josu San MartinJosu San MartinScore: 29,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 23:4029,392152,502,434142,986,0001,039,0002,113,536
2Aug 2, 2026 23:4029,399152,528,317143,053,0001,004,0002,113,536
3Aug 2, 2026 23:4029,407152,537,975143,083,0001,012,0002,113,536
4Aug 2, 2026 23:4029,415152,373,316143,098,0001,036,0002,113,536
5Aug 2, 2026 23:4029,424152,656,548143,142,0001,038,0002,113,536
6Aug 2, 2026 23:4029,424152,660,651142,904,0001,276,0002,113,536
7Aug 2, 2026 23:4029,431152,381,726143,196,0001,019,0002,113,536
8Aug 2, 2026 23:4029,449152,591,083143,246,0001,056,0002,113,536
9Aug 2, 2026 23:4030,764159,186,695149,623,0001,123,0002,113,536