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 listMay 11, 2026 06:54wnwnScore: 3,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 06:563,28835,662,97827,291,00002,113,536
2May 11, 2026 06:563,29434,569,38527,341,00002,113,536
3May 11, 2026 06:563,30134,661,29627,402,00002,113,536
4May 11, 2026 06:563,32034,819,87827,558,00002,113,536
5May 11, 2026 06:563,41135,923,94127,185,0001,129,0002,113,536
6May 11, 2026 06:563,43235,789,60428,487,00002,113,536
7May 11, 2026 06:563,46138,373,71527,727,0001,000,0002,113,536
8May 11, 2026 06:563,47638,603,83528,857,00002,113,536
9May 11, 2026 06:563,47936,994,50228,880,00002,113,536