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 listJan 23, 2026 01:17Josu San MartinJosu San MartinScore: 113,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 01:17113,455582,061,296554,930,000999,0002,289,664
2Jan 23, 2026 01:17113,505586,998,896552,173,0004,001,0002,281,472
3Jan 23, 2026 01:17113,525584,085,061554,277,0001,997,0002,269,184
4Jan 23, 2026 01:17113,544586,098,876555,366,000998,0002,523,136
5Jan 23, 2026 01:17113,557585,193,914554,427,0002,001,0002,269,184
6Jan 23, 2026 01:17113,626585,387,694554,770,0001,999,0002,281,472
7Jan 23, 2026 01:17113,941590,024,299556,314,0001,997,0002,289,664
8Jan 23, 2026 01:17113,974588,128,191554,477,0003,996,0002,281,472
9Jan 23, 2026 01:17113,996584,655,810555,582,0002,997,0002,281,472