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:16Josu San MartinJosu San MartinScore: 27,431Success
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:1627,377143,269,457132,884,0001,268,0002,113,536
2Aug 3, 2026 17:1627,410142,796,855133,061,0001,248,0002,113,536
3Aug 3, 2026 17:1627,419143,414,196133,079,0001,275,0002,113,536
4Aug 3, 2026 17:1627,423142,837,126133,116,0001,259,0002,113,536
5Aug 3, 2026 17:1627,431143,476,515133,155,0001,261,0002,113,536
6Aug 3, 2026 17:1627,434143,450,177133,172,0001,259,0002,113,536
7Aug 3, 2026 17:1627,437143,494,703133,442,0001,004,0002,113,536
8Aug 3, 2026 17:1627,440143,581,239133,439,0001,019,0002,113,536
9Aug 3, 2026 17:1627,593144,375,585133,945,0001,263,0002,113,536