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 listMar 19, 2026 06:56Dominique GarmierDominique GarmierScore: 148,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 06:56147,398748,344,340720,250,0002,000,0002,330,624
2Mar 19, 2026 14:30147,924752,343,890720,831,0003,999,0002,342,912
3Mar 19, 2026 14:30147,984754,305,809722,122,0003,000,0002,277,376
4Mar 19, 2026 06:56148,580758,219,570725,041,0003,000,0002,289,664
5Mar 19, 2026 06:56148,597756,994,964725,123,0003,000,0002,281,472
6Mar 19, 2026 14:30150,593764,100,614733,909,0003,999,0002,338,816