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 18:45anboto1anboto1Score: 176,385Success
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 18:46176,245873,650,580862,599,0001,006,0002,113,536
2Jul 31, 2026 18:46176,261873,692,276862,649,0001,033,0002,113,536
3Jul 31, 2026 18:46176,294873,769,498862,841,0001,003,0002,113,536
4Jul 31, 2026 18:46176,309873,812,669862,917,0001,001,0002,113,536
5Jul 31, 2026 18:46176,385874,201,272863,285,0001,002,0002,113,536
6Jul 31, 2026 18:46176,470874,735,866863,688,0001,018,0002,113,536
7Jul 31, 2026 18:46176,514875,307,627863,880,0001,039,0002,113,536
8Jul 31, 2026 18:46176,538875,035,513864,035,0001,002,0002,113,536
9Jul 31, 2026 18:46177,045877,520,437866,518,0001,007,0002,113,536