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 17:29Josu San MartinJosu San MartinScore: 27,745Success
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 17:3027,731144,304,416134,610,0001,272,0002,113,536
2Aug 3, 2026 17:3027,732144,899,375134,636,0001,253,0002,113,536
3Aug 3, 2026 17:3027,744144,128,857134,690,0001,256,0002,113,536
4Aug 3, 2026 17:3027,744144,390,860134,923,0001,025,0002,113,536
5Aug 3, 2026 17:3027,745144,992,491134,690,0001,262,0002,113,536
6Aug 3, 2026 17:3027,919146,099,795135,531,0001,275,0002,113,536
7Aug 3, 2026 17:3027,986145,552,711135,881,0001,252,0002,113,536
8Aug 3, 2026 17:3027,987145,550,662135,892,0001,249,0002,113,536
9Aug 3, 2026 17:3032,483167,621,709158,158,0001,010,0002,113,536