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 23:05Josu San MartinJosu San MartinScore: 28,030Success
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 23:0627,943145,381,797135,649,0001,275,0002,113,536
2Aug 3, 2026 23:0627,986145,307,055136,123,0001,012,0002,113,536
3Aug 3, 2026 23:0627,992145,609,831135,894,0001,267,0002,113,536
4Aug 3, 2026 23:0628,014145,516,668136,219,0001,054,0002,113,536
5Aug 3, 2026 23:0628,030147,668,592136,105,0001,244,0002,113,536
6Aug 3, 2026 23:0628,034145,803,752136,108,0001,262,0002,113,536
7Aug 3, 2026 23:0628,057146,001,557136,207,0001,273,0002,113,536
8Aug 3, 2026 23:0628,058145,867,544136,223,0001,263,0002,113,536
9Aug 3, 2026 23:0628,396147,301,714138,126,0001,016,0002,113,536