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 22:02Josu San MartinJosu San MartinScore: 29,658Success
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 22:0329,615157,332,972143,988,0001,127,0002,113,536
2Aug 2, 2026 22:0329,618155,116,454144,033,0001,100,0002,113,536
3Aug 2, 2026 22:0329,633155,832,923144,094,0001,110,0002,113,536
4Aug 2, 2026 22:0329,635155,243,846144,095,0001,118,0002,113,536
5Aug 2, 2026 22:0329,658156,103,044144,197,0001,131,0002,113,536
6Aug 2, 2026 22:0329,767156,554,855144,730,0001,130,0002,113,536
7Aug 2, 2026 22:0329,782155,924,211144,832,0001,101,0002,113,536
8Aug 2, 2026 22:0329,808156,166,944144,947,0001,113,0002,113,536
9Aug 2, 2026 22:0332,803170,786,686159,618,0001,119,0002,113,536