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 listAug 3, 2026 20:26anboto1anboto1Score: 57,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:2757,795291,727,245282,053,0001,147,0002,113,536
2Aug 3, 2026 20:2757,797291,670,731282,044,0001,163,0002,113,536
3Aug 3, 2026 20:2757,818293,120,145282,219,0001,091,0002,113,536
4Aug 3, 2026 20:2757,863292,513,449282,519,0001,012,0002,113,536
5Aug 3, 2026 20:2757,882292,107,446282,460,0001,162,0002,113,536
6Aug 3, 2026 20:2757,894291,843,119282,584,0001,099,0002,113,536
7Aug 3, 2026 20:2757,907292,216,075282,635,0001,110,0002,113,536
8Aug 3, 2026 20:2757,924292,278,130282,822,0001,006,0002,113,536
9Aug 3, 2026 20:2760,230303,639,341293,996,0001,132,0002,113,536