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 21:47Josu San MartinJosu San MartinScore: 27,661Success
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 21:4827,644143,984,567134,190,0001,270,0002,113,536
2Aug 3, 2026 21:4827,646143,848,443134,203,0001,267,0002,113,536
3Aug 3, 2026 21:4827,656144,869,872134,486,0001,031,0002,113,536
4Aug 3, 2026 21:4827,658144,503,449134,268,0001,258,0002,113,536
5Aug 3, 2026 21:4827,661144,657,411134,530,0001,013,0002,113,536
6Aug 3, 2026 21:4827,668144,133,680134,297,0001,281,0002,113,536
7Aug 3, 2026 21:4827,714144,214,046134,553,0001,250,0002,113,536
8Aug 3, 2026 21:4827,836144,588,025135,390,0001,009,0002,113,536
9Aug 3, 2026 21:4828,068146,684,445136,479,0001,055,0002,113,536