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 20, 2026 12:29Dominique GarmierDominique GarmierScore: 7,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 12:297,77691,164,75763,531,0001,008,0002,490,368
2Mar 20, 2026 12:297,84692,765,32263,122,0002,003,0002,289,664
3Mar 20, 2026 12:297,95192,998,96463,993,0001,999,0002,473,984