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 06:28Josu San MartinJosu San MartinScore: 29,666Success
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 06:2829,638154,254,247143,975,0001,254,0002,113,536
2Aug 3, 2026 06:2829,644153,469,529144,246,0001,012,0002,113,536
3Aug 3, 2026 06:2829,664153,896,042144,090,0001,265,0002,113,536
4Aug 3, 2026 06:2829,664155,299,970144,093,0001,262,0002,113,536
5Aug 3, 2026 06:2829,666153,788,186144,310,0001,058,0002,113,536
6Aug 3, 2026 06:2829,671153,800,519144,124,0001,267,0002,113,536
7Aug 3, 2026 06:2829,676153,646,010144,403,0001,014,0002,113,536
8Aug 3, 2026 06:2829,999156,079,465145,740,0001,256,0002,113,536
9Aug 3, 2026 06:2830,094155,905,405146,207,0001,258,0002,113,536