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 14, 2025 21:38Valentin KofmanValentin KofmanScore: 125,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 21:38125,569641,154,540614,288,0001,000,0002,273,280
2Jul 14, 2025 21:38125,580638,434,773614,345,000998,0002,387,968
3Jul 14, 2025 21:38125,608644,185,699615,478,00002,273,280
4Jul 14, 2025 21:38125,614640,506,296613,513,0001,998,0002,510,848
5Jul 14, 2025 21:38125,712641,915,055613,989,0001,999,0002,392,064
6Jul 14, 2025 21:38125,766641,952,123615,253,0001,000,0002,273,280
7Jul 14, 2025 21:38125,777643,229,717614,308,0001,997,0002,273,280
8Jul 14, 2025 21:38126,591646,450,400619,294,0001,000,0002,396,160
9Jul 14, 2025 21:38130,641671,244,115640,141,00002,273,280