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 4, 2026 10:36Josu San MartinJosu San MartinScore: 26,218Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 10:3626,180136,618,382127,025,0001,258,0002,113,536
2Aug 4, 2026 10:3626,183136,645,775127,035,0001,263,0002,113,536
3Aug 4, 2026 10:3626,203136,799,971127,390,0001,009,0002,113,536
4Aug 4, 2026 10:3626,217136,907,206127,452,0001,016,0002,113,536
5Aug 4, 2026 10:3626,218138,684,983127,440,0001,029,0002,113,536
6Aug 4, 2026 10:3626,224136,858,760127,243,0001,257,0002,113,536
7Aug 4, 2026 10:3626,237136,970,171127,308,0001,255,0002,113,536
8Aug 4, 2026 10:3626,244136,909,249127,356,0001,243,0002,113,536
9Aug 4, 2026 10:3626,263137,139,426127,418,0001,272,0002,113,536