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:06anboto1anboto1Score: 147,180Success
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:07147,025730,437,225719,339,0001,084,0002,113,536
2Jul 31, 2026 18:07147,045730,395,486719,465,0001,060,0002,113,536
3Jul 31, 2026 18:07147,144730,943,136719,924,0001,082,0002,113,536
4Jul 31, 2026 18:07147,165731,129,849720,038,0001,071,0002,113,536
5Jul 31, 2026 18:07147,180731,148,573720,126,0001,060,0002,113,536
6Jul 31, 2026 18:07147,250731,618,012720,457,0001,072,0002,113,536
7Jul 31, 2026 18:07147,374732,128,721721,053,0001,081,0002,113,536
8Jul 31, 2026 18:07147,583733,161,644722,078,0001,080,0002,113,536
9Jul 31, 2026 18:07147,585733,153,075722,094,0001,077,0002,113,536