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:20Priyansh RathiPriyansh RathiScore: 62,376Success
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:2062,318545,151,395514,242,0003,001,0002,527,232
2Mar 2, 2026 11:2062,376547,320,864514,723,0002,998,0002,367,488
3Mar 2, 2026 11:2062,390544,564,908514,841,0002,999,0002,371,584