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 listJul 31, 2026 19:32Josu San MartinJosu San MartinScore: 53,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:3353,232270,962,472259,729,0001,112,0002,113,536
2Jul 31, 2026 19:3353,306271,711,219260,069,0001,135,0002,113,536
3Jul 31, 2026 19:3353,327272,133,541260,169,0001,136,0002,113,536
4Jul 31, 2026 19:3353,350271,888,370260,298,0001,121,0002,113,536
5Jul 31, 2026 19:3353,368271,954,166260,370,0001,137,0002,113,536
6Jul 31, 2026 19:3353,372271,608,328260,411,0001,112,0002,113,536
7Jul 31, 2026 19:3353,409271,961,627260,587,0001,121,0002,113,536
8Jul 31, 2026 19:3353,650273,171,020261,775,0001,113,0002,113,536
9Jul 31, 2026 19:3353,653273,086,165261,791,0001,110,0002,113,536