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 17:50Josu San MartinJosu San MartinScore: 48,169Success
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 17:5448,121245,512,312233,780,0002,017,0002,174,976
2Aug 3, 2026 17:5448,140245,602,871233,876,0002,014,0002,129,920
3Aug 3, 2026 17:5448,157245,761,715233,808,0002,162,0002,174,976
4Aug 3, 2026 17:5448,162245,767,410233,981,0002,013,0002,174,976
5Aug 3, 2026 17:5448,169245,837,843233,990,0002,040,0002,129,920
6Aug 3, 2026 17:5448,359246,740,670234,952,0002,011,0002,134,016
7Aug 3, 2026 17:5448,369247,091,745234,860,0002,149,0002,129,920
8Aug 3, 2026 17:5448,528247,542,766235,644,0002,145,0002,174,976
9Aug 3, 2026 17:5448,556247,657,701235,918,0002,010,0002,174,976