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 03:50Josu San MartinJosu San MartinScore: 27,427Success
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 03:5027,361142,515,343132,813,0001,260,0002,113,536
2Aug 4, 2026 03:5027,406142,755,254133,022,0001,268,0002,113,536
3Aug 4, 2026 03:5027,420142,750,055133,307,0001,051,0002,113,536
4Aug 4, 2026 03:5027,424142,900,913133,105,0001,275,0002,113,536
5Aug 4, 2026 03:5027,427143,038,679133,129,0001,267,0002,113,536
6Aug 4, 2026 03:5027,439142,632,246133,370,0001,084,0002,113,536
7Aug 4, 2026 03:5027,440142,630,672133,181,0001,275,0002,113,536
8Aug 4, 2026 03:5027,477142,827,943133,516,0001,126,0002,113,536
9Aug 4, 2026 03:5027,647143,751,979134,424,0001,048,0002,113,536