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 listJun 1, 2026 21:59Maya RebholzMaya RebholzScore: 7,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 21:597,34470,220,46955,729,0005,227,0002,113,536
2Jun 1, 2026 21:597,35970,818,18955,568,0005,515,0002,113,536
3Jun 1, 2026 21:597,38070,918,15855,889,0005,368,0002,113,536
4Jun 1, 2026 21:597,39270,991,86456,011,0005,345,0002,117,632
5Jun 1, 2026 21:597,42071,166,14856,031,0005,556,0002,117,632
6Jun 1, 2026 21:597,54072,202,50457,026,0005,557,0002,113,536
7Jun 1, 2026 21:597,61372,388,93757,987,0005,208,0002,117,632
8Jun 1, 2026 21:597,66474,252,98058,084,0005,528,0002,113,536
9Jun 1, 2026 21:597,83274,651,59359,328,0005,682,0002,117,632