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 25, 2026 12:31Dominique GarmierDominique GarmierScore: 257,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 12:31257,8611,287,597,1401,263,518,00002,289,664
2Mar 24, 2026 10:23257,8881,294,594,9581,261,652,0001,997,0002,289,664
3Mar 24, 2026 10:23257,9701,288,219,8691,262,053,0001,998,0002,289,664
4Mar 24, 2026 10:23257,9751,287,281,0791,262,079,0001,998,0002,359,296
5Mar 25, 2026 12:31257,9911,287,769,2681,262,160,0001,998,0002,359,296
6Mar 25, 2026 12:31258,0741,293,288,9881,264,563,00002,285,568