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 listJan 8, 2025 23:20Ian MckibbenIan MckibbenScore: 1,821,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2025 23:201,819,34215,133,242,43815,044,562,00055,976,0002,269,184
2Jan 8, 2025 23:201,821,02115,143,495,88015,038,509,00075,967,0002,289,664
3Jan 8, 2025 23:201,821,34015,150,597,81915,055,147,00061,975,0002,277,376