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 listFeb 18, 2026 11:49wnwnScore: 7,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 11:496,32682,465,96447,459,0005,048,0002,473,984
2Feb 18, 2026 11:496,36384,975,50149,825,0002,989,0002,461,696
3Feb 18, 2026 11:496,51878,727,23050,089,0004,007,0002,494,464
4Feb 18, 2026 11:497,14783,625,36457,313,0002,011,0002,490,368
5Feb 18, 2026 11:497,21887,276,38155,914,0003,993,0002,371,584
6Feb 18, 2026 11:497,23984,265,69156,082,0004,005,0002,400,256