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 3, 2026 12:24RuszrokRuszrokScore: 38,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 12:2438,218342,616,228317,209,00002,273,280
2Feb 3, 2026 12:2438,227346,319,230316,282,0001,000,0002,277,376
3Feb 3, 2026 12:2438,236343,939,389317,356,00002,400,256
4Feb 3, 2026 12:2438,236344,651,413317,355,00002,277,376
5Feb 3, 2026 12:2438,239346,469,995317,382,00002,277,376
6Feb 3, 2026 12:2438,268341,310,339317,621,00002,387,968
7Feb 3, 2026 12:2438,807349,458,157322,099,00002,277,376
8Feb 3, 2026 12:2438,821353,014,126322,216,00002,277,376
9Feb 3, 2026 12:2438,835347,164,835321,328,0001,001,0002,277,376