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,274Success
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,14284,142,44157,266,0002,009,0002,285,568
2Nov 4, 2025 09:547,20588,945,56958,804,000996,0002,285,568
3Nov 4, 2025 09:547,21788,289,00457,905,0001,996,0002,285,568
4Nov 4, 2025 09:547,27486,972,80559,371,0001,006,0002,285,568
5Nov 4, 2025 09:547,28486,646,74459,454,0001,007,0002,273,280
6Nov 4, 2025 09:547,28984,636,53160,501,00002,265,088