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 21:27Josu San MartinJosu San MartinScore: 29,744Success
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 21:2829,671155,353,618144,261,0001,129,0002,117,632
2Aug 2, 2026 21:2829,678156,202,154144,310,0001,113,0002,113,536
3Aug 2, 2026 21:2829,685156,197,705144,317,0001,144,0002,113,536
4Aug 2, 2026 21:2829,689156,232,398144,340,0001,138,0002,113,536
5Aug 2, 2026 21:2829,744156,484,848144,569,0001,179,0002,113,536
6Aug 2, 2026 21:2829,803156,146,784144,916,0001,122,0002,113,536
7Aug 2, 2026 21:2829,850157,001,829145,140,0001,128,0002,113,536
8Aug 2, 2026 21:2829,943156,715,175145,610,0001,112,0002,113,536
9Aug 2, 2026 21:2831,005162,404,165150,801,0001,127,0002,113,536