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 listOct 9, 2026 21:28highload-churnerhighload-churnerScore: 56,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:0454,795277,451,570252,598,00015,900,00020,480
2Oct 9, 2026 22:0454,983278,376,909252,748,00016,673,00020,480
3Oct 9, 2026 22:0455,045278,673,303253,035,00016,689,00020,480
4Oct 9, 2026 22:0455,936283,032,110252,182,00021,909,00020,480
5Oct 9, 2026 22:0456,144284,055,119252,376,00022,731,00020,480
6Oct 9, 2026 22:0456,222284,987,450252,754,00022,735,00020,480
7Oct 9, 2026 22:0457,760292,392,822267,228,00015,799,00020,480
8Oct 9, 2026 22:0457,775302,532,189265,511,00017,590,00020,480
9Oct 9, 2026 22:0457,845292,470,166267,076,00016,365,00020,480