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 07:38Josu San MartinJosu San MartinScore: 27,058Success
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 07:3826,971140,578,491130,916,0001,246,0002,113,536
2Aug 4, 2026 07:3826,993140,683,634131,021,0001,248,0002,113,536
3Aug 4, 2026 07:3827,004140,713,032131,066,0001,257,0002,117,632
4Aug 4, 2026 07:3827,043140,699,638131,502,0001,009,0002,113,536
5Aug 4, 2026 07:3827,058141,042,299131,553,0001,035,0002,113,536
6Aug 4, 2026 07:3827,099141,269,676131,514,0001,273,0002,113,536
7Aug 4, 2026 07:3827,105141,370,359131,807,0001,009,0002,113,536
8Aug 4, 2026 07:3827,414142,755,708133,071,0001,259,0002,113,536
9Aug 4, 2026 07:3827,835144,601,840135,117,0001,277,0002,113,536