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 listFeb 15, 2026 22:22wnwnScore: 9,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:228,43995,155,49763,040,0007,004,0002,433,024
2Feb 15, 2026 22:228,48595,437,52360,366,00010,061,0002,490,368
3Feb 15, 2026 22:228,62798,512,30362,530,0009,077,0002,465,792
4Feb 15, 2026 22:229,579103,844,07970,446,0009,057,0002,273,280
5Feb 15, 2026 22:229,728107,061,97872,771,0007,974,0002,465,792
6Feb 15, 2026 22:229,936107,141,48374,420,0008,045,0002,490,368