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 03:17Josu San MartinJosu San MartinScore: 24,210Success
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 03:1824,198126,950,350117,317,0001,257,0002,113,536
2Aug 29, 2026 03:1824,207127,014,002117,360,0001,255,0002,113,536
3Aug 29, 2026 03:1824,208127,790,782117,348,0001,272,0002,113,536
4Aug 29, 2026 03:1824,210127,042,771117,375,0001,258,0002,113,536
5Aug 29, 2026 03:1824,210127,035,094117,376,0001,256,0002,113,536
6Aug 29, 2026 03:1824,211127,103,705117,377,0001,260,0002,113,536
7Aug 29, 2026 03:1824,212127,063,877117,377,0001,266,0002,113,536
8Aug 29, 2026 03:1824,532128,631,708118,960,0001,249,0002,113,536
9Aug 29, 2026 03:1824,614129,065,458119,350,0001,261,0002,113,536