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 listJan 5, 2026 16:34Josu San MartinJosu San MartinScore: 28,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 16:3425,471832,773,75673,579,000137,832,000105,373,696
2Jan 5, 2026 16:3428,8611,105,978,84876,655,000162,893,000151,625,728
3Jan 5, 2026 16:3448,8772,987,382,80885,345,000320,336,000325,902,336