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 listNov 4, 2025 09:54Tejas G.Tejas G.Score: 7,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 09:547,13182,861,87157,179,0002,006,0002,285,568
2Nov 4, 2025 09:547,13582,018,28157,217,0002,007,0002,531,328
3Nov 4, 2025 09:547,13685,121,74257,219,0002,007,0002,285,568
4Nov 4, 2025 09:547,13779,693,47658,236,0001,004,0002,260,992
5Nov 4, 2025 09:547,20487,812,16457,802,0001,993,0002,277,376
6Nov 4, 2025 09:547,20583,794,48758,807,000996,0002,277,376
7Nov 4, 2025 09:547,20789,127,89557,823,0001,993,0002,285,568
8Nov 4, 2025 09:547,21084,092,59958,825,0001,014,0002,285,568
9Nov 4, 2025 09:547,21086,504,02058,830,0001,014,0002,285,568