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 17:22Josu San MartinJosu San MartinScore: 30,358Success
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 17:2330,302158,512,139147,352,0001,132,0002,113,536
2Aug 2, 2026 17:2330,325158,840,008147,472,0001,124,0002,113,536
3Aug 2, 2026 17:2330,333159,137,345147,490,0001,143,0002,113,536
4Aug 2, 2026 17:2330,343160,719,785147,557,0001,128,0002,113,536
5Aug 2, 2026 17:2330,358159,219,092147,610,0001,148,0002,113,536
6Aug 2, 2026 17:2330,408159,021,800147,868,0001,135,0002,113,536
7Aug 2, 2026 17:2330,450159,337,741148,082,0001,127,0002,113,536
8Aug 2, 2026 17:2330,540160,434,815148,519,0001,131,0002,113,536
9Aug 2, 2026 17:2330,905162,200,569150,317,0001,122,0002,113,536