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 29, 2026 20:01sandheep rajkumarsandheep rajkumarScore: 525,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:01524,2044,380,605,6604,287,924,00062,969,0002,273,280
2Jan 29, 2026 20:01525,1774,383,650,7394,292,000,00066,968,0002,383,872
3Jan 29, 2026 20:01525,1794,392,326,0184,289,017,00069,967,0002,285,568
4Jan 29, 2026 20:01525,2534,390,732,6874,297,631,00061,965,0002,273,280
5Jan 29, 2026 20:01525,3824,395,586,6604,283,710,00076,958,0002,371,584
6Jan 29, 2026 20:01525,4664,394,015,6764,285,414,00075,954,0002,277,376
7Jan 29, 2026 20:01526,0664,395,526,4974,303,375,00062,976,0002,273,280
8Jan 29, 2026 20:01526,1844,401,256,0864,293,372,00073,954,0002,273,280
9Jan 29, 2026 20:01527,4594,400,665,9174,304,945,00072,965,0002,273,280