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:35anboto1anboto1Score: 57,791Success
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:3657,638291,671,269281,288,0001,143,0002,113,536
2Aug 3, 2026 20:3657,644291,182,329281,273,0001,186,0002,113,536
3Aug 3, 2026 20:3657,645290,890,084281,342,0001,122,0002,113,536
4Aug 3, 2026 20:3657,665291,633,058281,372,0001,191,0002,113,536
5Aug 3, 2026 20:3657,791291,404,954282,004,0001,174,0002,113,536
6Aug 3, 2026 20:3658,149293,359,914283,727,0001,206,0002,113,536
7Aug 3, 2026 20:3658,551295,410,618285,733,0001,170,0002,113,536
8Aug 3, 2026 20:3659,493302,433,335290,340,0001,177,0002,113,536
9Aug 3, 2026 20:3660,145303,465,014293,690,0001,023,0002,113,536