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 29, 2026 00:36Josu San MartinJosu San MartinScore: 24,456Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 00:3624,448128,179,740118,542,0001,255,0002,113,536
2Aug 29, 2026 00:3624,450128,141,600118,546,0001,260,0002,113,536
3Aug 29, 2026 00:3624,451128,261,273118,550,0001,260,0002,113,536
4Aug 29, 2026 00:3624,453128,251,674118,574,0001,248,0002,113,536
5Aug 29, 2026 00:3624,456128,253,792118,576,0001,263,0002,113,536
6Aug 29, 2026 00:3624,458128,307,061118,593,0001,254,0002,113,536
7Aug 29, 2026 00:3624,459128,240,803118,584,0001,267,0002,113,536
8Aug 29, 2026 00:3624,468128,236,414118,648,0001,247,0002,113,536
9Aug 29, 2026 00:3624,598128,942,949119,384,0001,147,0002,113,536