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:51Josu San MartinJosu San MartinScore: 29,664Success
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:5129,638155,971,323144,097,0001,134,0002,113,536
2Aug 2, 2026 21:5129,640155,854,780144,125,0001,114,0002,113,536
3Aug 2, 2026 21:5129,642155,290,419144,111,0001,135,0002,113,536
4Aug 2, 2026 21:5129,648156,079,449144,140,0001,136,0002,113,536
5Aug 2, 2026 21:5129,664156,079,086144,218,0001,137,0002,113,536
6Aug 2, 2026 21:5129,674156,151,869144,271,0001,133,0002,113,536
7Aug 2, 2026 21:5129,677155,549,578144,280,0001,138,0002,113,536
8Aug 2, 2026 21:5129,686155,464,465144,343,0001,122,0002,113,536
9Aug 2, 2026 21:5129,745156,451,109144,618,0001,135,0002,113,536