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 00:30Josu San MartinJosu San MartinScore: 24,401Success
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 00:3124,389127,868,314118,266,0001,244,0002,117,632
2Aug 29, 2026 00:3124,394127,923,270118,278,0001,257,0002,113,536
3Aug 29, 2026 00:3124,399127,977,106118,301,0001,258,0002,113,536
4Aug 29, 2026 00:3124,400127,980,896118,294,0001,270,0002,113,536
5Aug 29, 2026 00:3124,401128,612,343118,537,0001,032,0002,113,536
6Aug 29, 2026 00:3124,403127,948,950118,316,0001,263,0002,113,536
7Aug 29, 2026 00:3124,407127,991,110118,563,0001,032,0002,113,536
8Aug 29, 2026 00:3124,445128,136,044118,595,0001,187,0002,113,536
9Aug 29, 2026 00:3124,506128,461,734118,831,0001,251,0002,113,536