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 listOct 28, 2024 18:46RileyRileyScore: 57,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:4657,345502,073,198473,965,0001,999,0002,523,136
2Oct 28, 2024 18:4657,348509,402,008473,993,0001,999,0002,269,184
3Oct 28, 2024 18:4657,349500,675,452473,998,0001,999,0002,289,664
4Oct 28, 2024 18:4657,360501,554,347474,091,0002,000,0002,289,664
5Oct 28, 2024 18:4657,363503,548,906474,109,0002,000,0002,289,664
6Oct 28, 2024 18:4657,367500,084,605475,143,0001,000,0002,531,328
7Oct 28, 2024 18:4657,371498,222,051474,180,0002,000,0002,281,472
8Oct 28, 2024 18:4657,371503,038,073474,180,0002,000,0002,269,184
9Oct 28, 2024 18:4657,407508,172,194475,483,000998,0002,265,088