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 12:20Priyansh RathiPriyansh RathiScore: 46,918Success
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 12:2046,840416,542,140385,775,0002,998,0002,371,584
2Mar 2, 2026 12:2046,918420,330,106388,422,0001,001,0002,371,584
3Mar 2, 2026 12:2046,928418,285,907388,507,000998,0002,375,680