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 28, 2026 08:52TudyMTudyMScore: 37,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:5237,655330,803,291311,537,0001,001,0002,387,968
2Apr 28, 2026 08:5237,665333,556,456310,626,0001,997,0002,383,872
3Apr 28, 2026 08:5237,670330,857,081309,668,0002,996,0002,387,968
4Apr 28, 2026 08:5237,676331,488,100309,721,0002,997,0002,306,048
5Apr 28, 2026 08:5237,676328,809,717309,722,0002,997,0002,379,776
6Apr 28, 2026 08:5237,680330,968,318310,750,0001,998,0002,383,872
7Apr 28, 2026 08:5237,683332,857,909310,771,0001,998,0002,306,048
8Apr 28, 2026 08:5237,690328,994,739310,829,0001,998,0002,306,048
9Apr 28, 2026 08:5237,691332,345,952309,840,0002,998,0002,371,584