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 20:08Josu San MartinJosu San MartinScore: 32,590Success
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 20:0932,566170,415,277158,439,0001,138,0002,113,536
2Aug 2, 2026 20:0932,570170,396,000158,479,0001,117,0002,113,536
3Aug 2, 2026 20:0932,583169,723,376158,521,0001,137,0002,113,536
4Aug 2, 2026 20:0932,586170,479,240158,537,0001,136,0002,113,536
5Aug 2, 2026 20:0932,590171,806,415158,569,0001,123,0002,113,536
6Aug 2, 2026 20:0932,591169,817,358158,579,0001,118,0002,113,536
7Aug 2, 2026 20:0932,608170,571,515158,665,0001,115,0002,113,536
8Aug 2, 2026 20:0932,609169,811,155158,657,0001,131,0002,113,536
9Aug 2, 2026 20:0932,624170,714,077158,705,0001,154,0002,113,536