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:16anboto1anboto1Score: 57,725Success
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:1657,634290,622,048281,283,0001,124,0002,113,536
2Aug 3, 2026 20:1657,673291,764,944281,443,0001,159,0002,113,536
3Aug 3, 2026 20:1657,684291,179,271281,548,0001,106,0002,113,536
4Aug 3, 2026 20:1657,690291,093,540281,565,0001,116,0002,113,536
5Aug 3, 2026 20:1657,725291,235,438281,767,0001,086,0002,113,536
6Aug 3, 2026 20:1657,769292,103,705281,930,0001,140,0002,113,536
7Aug 3, 2026 20:1657,870292,120,066282,459,0001,108,0002,113,536
8Aug 3, 2026 20:1658,449295,519,283285,256,0001,147,0002,113,536
9Aug 3, 2026 20:1659,140298,208,341288,744,0001,044,0002,113,536