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 2, 2026 10:40Priyansh RathiPriyansh RathiScore: 68,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 10:4068,391592,674,086565,647,0001,998,0002,535,424
2Mar 2, 2026 10:4068,423595,545,895565,910,0001,999,0002,371,584
3Mar 2, 2026 10:4068,488601,546,088567,449,000999,0002,355,200