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 01:23Josu San MartinJosu San MartinScore: 29,595Success
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 01:2329,566153,975,747143,611,0001,267,0002,113,536
2Aug 3, 2026 01:2329,578154,070,658143,675,0001,261,0002,113,536
3Aug 3, 2026 01:2329,582153,473,629143,679,0001,274,0002,113,536
4Aug 3, 2026 01:2329,585153,445,146143,924,0001,046,0002,113,536
5Aug 3, 2026 01:2329,595153,419,525143,972,0001,044,0002,113,536
6Aug 3, 2026 01:2329,614153,518,855143,844,0001,268,0002,113,536
7Aug 3, 2026 01:2329,662153,471,679144,071,0001,274,0002,113,536
8Aug 3, 2026 01:2329,826155,274,079145,109,0001,040,0002,113,536
9Aug 3, 2026 01:2330,066155,784,452146,070,0001,257,0002,113,536