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 23, 2025 21:23Alona MalohAlona MalohScore: 59,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 21:2359,815529,121,701435,408,00061,057,0002,285,568
2Apr 23, 2025 21:2359,820528,590,657439,448,00057,058,0002,277,376
3Apr 23, 2025 21:2359,866518,310,372437,904,00058,987,0002,285,568
4Apr 23, 2025 21:2359,928518,567,713447,363,00050,040,0002,277,376
5Apr 23, 2025 21:2359,950522,563,767439,635,00057,951,0002,277,376
6Apr 23, 2025 21:2359,960540,579,260421,719,00075,949,0002,277,376
7Apr 23, 2025 21:2360,005520,401,762439,034,00059,004,0002,285,568
8Apr 23, 2025 21:2360,345531,099,671441,001,00059,864,0002,277,376
9Apr 23, 2025 21:2360,353526,671,008437,813,00063,117,0002,277,376