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 listSep 29, 2026 10:43wnwnScore: 3,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:443,26735,896,09527,117,000020,480
2Sep 29, 2026 10:443,26735,800,26227,119,000020,480
3Sep 29, 2026 10:443,26835,959,53927,128,000020,480
4Sep 29, 2026 10:443,28436,033,20027,262,000020,480
5Sep 29, 2026 10:443,28636,100,84027,278,000020,480
6Sep 29, 2026 10:443,29236,147,46527,330,000020,480
7Sep 29, 2026 10:443,30336,756,43426,413,0001,004,00020,480
8Sep 29, 2026 10:443,33036,567,75627,647,000020,480
9Sep 29, 2026 10:443,43737,229,72028,532,000020,480