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 4, 2026 03:29Josu San MartinJosu San MartinScore: 31,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 03:2931,462162,450,466153,131,0001,035,0002,113,536
2Aug 4, 2026 03:2931,502163,460,866153,086,0001,278,0002,113,536
3Aug 4, 2026 03:2931,531162,658,454153,484,0001,020,0002,113,536
4Aug 4, 2026 03:2931,607163,278,578153,871,0001,005,0002,113,536
5Aug 4, 2026 03:2931,697164,983,452154,313,0001,004,0002,113,536
6Aug 4, 2026 03:2931,707163,784,038154,366,0001,003,0002,113,536
7Aug 4, 2026 03:2931,731163,876,380154,455,0001,030,0002,113,536
8Aug 4, 2026 03:2931,771164,760,821154,676,0001,005,0002,113,536
9Aug 4, 2026 03:2931,790164,106,675154,751,0001,021,0002,113,536