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 02:57Josu San MartinJosu San MartinScore: 27,539Success
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 02:5827,492143,769,878133,453,0001,258,0002,113,536
2Aug 4, 2026 02:5827,496143,353,482133,474,0001,261,0002,113,536
3Aug 4, 2026 02:5827,532144,034,283133,638,0001,271,0002,113,536
4Aug 4, 2026 02:5827,534143,293,362133,793,0001,128,0002,113,536
5Aug 4, 2026 02:5827,539144,018,388133,687,0001,255,0002,113,536
6Aug 4, 2026 02:5827,542143,992,335133,699,0001,257,0002,113,536
7Aug 4, 2026 02:5827,578143,523,895133,958,0001,178,0002,113,536
8Aug 4, 2026 02:5827,788145,323,431134,992,0001,174,0002,113,536
9Aug 4, 2026 02:5828,479147,992,086138,299,0001,251,0002,113,536