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 2, 2026 18:00Josu San MartinJosu San MartinScore: 29,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 18:0129,781156,678,684144,806,0001,123,0002,113,536
2Aug 2, 2026 18:0129,783156,708,456144,813,0001,128,0002,113,536
3Aug 2, 2026 18:0129,792155,965,851144,850,0001,134,0002,113,536
4Aug 2, 2026 18:0129,803156,762,261144,905,0001,130,0002,113,536
5Aug 2, 2026 18:0129,804156,806,474144,916,0001,128,0002,113,536
6Aug 2, 2026 18:0129,808156,876,786144,931,0001,130,0002,113,536
7Aug 2, 2026 18:0129,817156,151,907144,985,0001,122,0002,113,536
8Aug 2, 2026 18:0129,818156,969,633144,983,0001,127,0002,113,536
9Aug 2, 2026 18:0130,034157,976,717146,047,0001,123,0002,113,536