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 15:59Josu San MartinJosu San MartinScore: 28,363Success
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 15:5928,302149,163,021137,412,0001,268,0002,113,536
2Aug 3, 2026 15:5928,310147,746,753137,715,0001,008,0002,113,536
3Aug 3, 2026 15:5928,338147,934,388137,585,0001,274,0002,113,536
4Aug 3, 2026 15:5928,344147,895,312137,635,0001,255,0002,113,536
5Aug 3, 2026 15:5928,363148,077,518137,970,0001,013,0002,113,536
6Aug 3, 2026 15:5928,364147,977,112137,983,0001,005,0002,113,536
7Aug 3, 2026 15:5928,376148,171,512137,787,0001,257,0002,113,536
8Aug 3, 2026 15:5928,415147,672,513137,981,0001,255,0002,113,536
9Aug 3, 2026 15:5929,190152,054,782141,775,0001,259,0002,113,536