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 16:41Josu San MartinJosu San MartinScore: 27,628Success
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 16:4127,603144,352,952133,994,0001,261,0002,113,536
2Aug 3, 2026 16:4127,604143,655,967134,012,0001,252,0002,113,536
3Aug 3, 2026 16:4127,610144,392,398134,274,0001,015,0002,113,536
4Aug 3, 2026 16:4127,618143,785,793134,076,0001,257,0002,113,536
5Aug 3, 2026 16:4127,628144,487,775134,103,0001,277,0002,113,536
6Aug 3, 2026 16:4127,643144,352,019134,433,0001,022,0002,113,536
7Aug 3, 2026 16:4127,713144,814,133134,533,0001,262,0002,113,536
8Aug 3, 2026 16:4127,714144,229,659134,795,0001,004,0002,113,536
9Aug 3, 2026 16:4127,821144,529,549135,276,0001,049,0002,113,536