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 listOct 19, 2025 02:33Marco BarboneMarco BarboneScore: 785,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 02:33784,6363,873,669,7693,843,715,000999,0002,277,376
2Oct 19, 2025 02:33784,7623,868,079,6933,844,336,000999,0002,277,376
3Oct 19, 2025 02:33784,7833,873,524,8193,844,439,000999,0002,273,280
4Oct 19, 2025 02:33785,0593,869,938,2953,845,791,000999,0002,273,280
5Oct 19, 2025 02:33785,1093,872,709,9953,845,034,0001,998,0002,277,376
6Oct 19, 2025 02:33785,1593,872,107,1383,846,280,000999,0002,273,280
7Oct 19, 2025 02:33785,1653,874,693,7153,847,310,00002,277,376
8Oct 19, 2025 02:33785,2723,883,120,2423,846,834,000999,0002,273,280
9Oct 19, 2025 02:33785,4933,872,000,8483,846,918,0001,998,0002,273,280