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 listJul 31, 2026 18:07anboto1anboto1Score: 147,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:08147,060730,568,825719,528,0001,067,0002,113,536
2Jul 31, 2026 18:08147,203731,256,508720,225,0001,072,0002,113,536
3Jul 31, 2026 18:08147,437732,472,311721,340,0001,103,0002,113,536
4Jul 31, 2026 18:08147,462732,529,210721,485,0001,081,0002,113,536
5Jul 31, 2026 18:08147,554734,282,721721,947,0001,069,0002,113,536
6Jul 31, 2026 18:08147,629733,383,748722,306,0001,077,0002,113,536
7Jul 31, 2026 18:08147,644733,496,642722,379,0001,078,0002,113,536
8Jul 31, 2026 18:08147,678733,786,874722,556,0001,071,0002,113,536
9Jul 31, 2026 18:08147,804734,207,035723,167,0001,076,0002,113,536