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 listMar 13, 2026 04:46olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:11Yuriy Lyfenko10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 18:11021,493,33301,094,000405,504Exit with code 1:
2Mar 13, 2026 04:462,08534,021,52717,306,00002,273,280
3Mar 13, 2026 04:462,08739,929,07317,323,00002,506,752
4Mar 13, 2026 04:462,08744,108,22317,320,00002,273,280
5Mar 13, 2026 04:462,08942,800,97817,342,00002,273,280
6Mar 13, 2026 04:462,09034,402,01717,347,00002,273,280
7Mar 13, 2026 04:462,09038,619,19817,349,00002,273,280
8Mar 13, 2026 04:462,09043,044,69617,351,00002,502,656
9Mar 13, 2026 04:462,09239,694,06417,366,00002,273,280
10Mar 13, 2026 04:462,10738,113,85917,487,00002,273,280