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:21Josu San MartinJosu San MartinScore: 27,476Success
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:2227,379142,556,963132,903,0001,258,0002,113,536
2Aug 4, 2026 02:2227,411143,395,404133,069,0001,247,0002,113,536
3Aug 4, 2026 02:2227,435143,476,956133,179,0001,256,0002,113,536
4Aug 4, 2026 02:2227,448143,602,230133,238,0001,259,0002,113,536
5Aug 4, 2026 02:2227,476143,707,549133,381,0001,253,0002,113,536
6Aug 4, 2026 02:2227,477143,727,250133,602,0001,039,0002,113,536
7Aug 4, 2026 02:2227,479143,351,975133,382,0001,266,0002,113,536
8Aug 4, 2026 02:2227,605143,955,771134,013,0001,253,0002,113,536
9Aug 4, 2026 02:2228,562149,006,306138,696,0001,261,0002,113,536