Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 11, 2026 01:08Josu San MartinJosu San MartinScore: 3,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:083,86840,550,34931,007,0001,102,0002,113,536
2May 11, 2026 01:083,87340,277,15331,061,0001,092,0002,113,536
3May 11, 2026 01:083,87440,020,01131,081,0001,076,0002,113,536
4May 11, 2026 01:083,87539,840,15431,079,0001,085,0002,113,536
5May 11, 2026 01:083,88540,348,38131,117,0001,133,0002,113,536
6May 11, 2026 01:083,90142,059,42031,204,0001,178,0002,113,536
7May 11, 2026 01:083,90242,432,88231,304,0001,089,0002,113,536
8May 11, 2026 01:083,90540,025,22131,329,0001,085,0002,113,536
9May 11, 2026 01:083,99040,910,51432,007,0001,111,0002,113,536