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 11:35Priyansh RathiPriyansh RathiScore: 45,982Success
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 11:3545,950407,419,105380,388,0001,001,0002,539,520
2Mar 2, 2026 11:3545,982408,912,621378,656,0002,997,0002,359,296
3Mar 2, 2026 11:3546,032407,435,581380,068,0002,000,0002,535,424