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 listApr 27, 2024 22:27Joad NacerJoad NacerScore: 8,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 22:278,62397,298,95370,565,0001,008,0002,277,376
2Apr 27, 2024 22:278,624103,309,74070,571,0001,008,0002,285,568
3Apr 27, 2024 22:278,63196,689,20570,629,0001,008,0002,285,568
4Apr 27, 2024 22:278,635104,811,18970,658,0001,009,0002,285,568
5Apr 27, 2024 22:278,651102,234,09870,808,000997,0002,285,568
6Apr 27, 2024 22:278,653100,961,74069,823,0001,994,0002,285,568
7Apr 27, 2024 22:278,756133,049,15072,673,97902,269,184
8Apr 27, 2024 22:278,759134,072,12372,697,90902,273,280
9Apr 27, 2024 22:278,769136,486,97072,783,05502,281,472
10Apr 27, 2024 22:278,97897,301,03873,509,0001,006,0002,277,376
11Apr 27, 2024 22:279,523109,257,62579,039,00002,285,568
12Apr 27, 2024 22:2715,339150,610,864126,314,0001,002,0002,285,568