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 27, 2026 02:14Code HintsCode HintsScore: 7,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:157,17667,306,50556,472,0003,090,0002,113,536
2Jun 27, 2026 02:157,19967,324,08456,530,0003,225,0002,113,536
3Jun 27, 2026 02:157,20067,418,53556,610,0003,153,0002,113,536
4Jun 27, 2026 02:157,20167,270,03056,697,0003,072,0002,113,536
5Jun 27, 2026 02:157,21567,621,25656,832,0003,054,0002,113,536
6Jun 27, 2026 02:157,26567,843,71257,137,0003,168,0002,113,536
7Jun 27, 2026 02:157,29069,479,78557,395,0003,118,0002,113,536
8Jun 27, 2026 02:157,35168,726,66157,800,0003,217,0002,113,536
9Jun 27, 2026 02:157,38368,765,58458,101,0003,179,0002,113,536