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 1, 2026 20:33leoweleoweScore: 366,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:33365,8833,061,275,4502,967,858,00068,973,0002,285,568
2Apr 1, 2026 20:33366,5923,071,757,8052,979,740,00062,973,0002,293,760
3Apr 1, 2026 20:33366,7373,067,391,7602,965,971,00077,946,0002,285,568
4Apr 1, 2026 20:33366,9503,077,283,2802,987,728,00057,955,0002,289,664
5Apr 1, 2026 20:33366,9573,070,432,7092,955,782,00089,962,0002,285,568
6Apr 1, 2026 20:33367,2473,074,429,6843,004,179,00043,973,0002,285,568
7Apr 1, 2026 20:33367,2773,076,173,3412,991,427,00056,970,0002,502,656
8Apr 1, 2026 20:33370,9693,109,272,5343,002,090,00076,951,0002,293,760
9Apr 1, 2026 20:33380,8733,185,915,5203,101,282,00059,966,0002,293,760