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 2, 2026 22:38Josu San MartinJosu San MartinScore: 31,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 22:3931,262163,292,784152,059,0001,128,0002,113,536
2Aug 2, 2026 22:3931,276164,034,475152,136,0001,120,0002,113,536
3Aug 2, 2026 22:3931,277164,032,580152,131,0001,129,0002,113,536
4Aug 2, 2026 22:3931,287163,360,333152,167,0001,143,0002,113,536
5Aug 2, 2026 22:3931,287163,318,635152,178,0001,133,0002,113,536
6Aug 2, 2026 22:3931,386163,741,704152,685,0001,108,0002,113,536
7Aug 2, 2026 22:3931,741165,622,307154,432,0001,102,0002,113,536
8Aug 2, 2026 22:3931,744165,516,332154,428,0001,120,0002,113,536
9Aug 2, 2026 22:3932,465169,930,874157,964,0001,117,0002,113,536