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:25Josu San MartinJosu San MartinScore: 27,571Success
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:2527,537144,077,052133,678,0001,256,0002,113,536
2Aug 3, 2026 16:2527,541144,146,886133,685,0001,270,0002,113,536
3Aug 3, 2026 16:2527,555144,644,833134,017,0001,003,0002,113,536
4Aug 3, 2026 16:2527,564144,128,921133,801,0001,265,0002,113,536
5Aug 3, 2026 16:2527,571144,166,651133,834,0001,268,0002,113,536
6Aug 3, 2026 16:2527,596143,606,543134,076,0001,147,0002,113,536
7Aug 3, 2026 16:2527,614143,691,628134,037,0001,276,0002,113,536
8Aug 3, 2026 16:2527,830145,451,858135,354,0001,017,0002,113,536
9Aug 3, 2026 16:2528,163146,397,615136,998,0001,003,0002,113,536