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 02:59Josu San MartinJosu San MartinScore: 28,951Success
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 03:0028,940150,324,622140,550,0001,259,0002,113,536
2Aug 3, 2026 03:0028,946150,830,516140,568,0001,269,0002,113,536
3Aug 3, 2026 03:0028,948150,969,530140,594,0001,252,0002,113,536
4Aug 3, 2026 03:0028,950150,978,470140,596,0001,263,0002,113,536
5Aug 3, 2026 03:0028,951150,917,052140,605,0001,258,0002,113,536
6Aug 3, 2026 03:0028,960150,920,733140,631,0001,274,0002,113,536
7Aug 3, 2026 03:0028,962151,070,991140,900,0001,017,0002,113,536
8Aug 3, 2026 03:0029,000151,209,095140,820,0001,282,0002,113,536
9Aug 3, 2026 03:0029,193152,129,060141,783,0001,267,0002,113,536