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 listDec 8, 2025 11:43Jatin GargJatin GargScore: 79,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:4378,704677,903,723652,243,0001,000,0002,285,568
2Dec 8, 2025 11:4379,113685,072,102654,639,0001,998,0002,289,664
3Dec 8, 2025 11:4379,114685,265,665654,648,0001,998,0002,285,568
4Dec 8, 2025 11:4379,115688,428,089654,657,0001,998,0002,285,568
5Dec 8, 2025 11:4379,123680,024,447654,722,0001,999,0002,277,376
6Dec 8, 2025 11:4379,128684,124,869654,767,0001,999,0002,519,040
7Dec 8, 2025 11:4379,146683,126,040654,915,0001,999,0002,277,376
8Dec 8, 2025 11:4379,152682,838,221654,960,0001,999,0002,285,568
9Dec 8, 2025 11:4379,222685,019,908655,548,0001,998,0002,527,232