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 listOct 2, 2026 15:24Karthik ReddyKarthik ReddyScore: 3,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 15:253,2433,035,960,13226,922,000020,480
2Oct 2, 2026 15:253,2453,036,058,39626,936,000024,576
3Oct 2, 2026 15:253,2463,035,974,39926,943,000020,480
4Oct 2, 2026 15:253,2463,036,038,70626,947,000020,480
5Oct 2, 2026 15:253,2483,036,064,35926,960,000020,480
6Oct 2, 2026 15:253,2493,036,118,99526,970,000024,576
7Oct 2, 2026 15:253,2513,036,121,10126,986,000024,576
8Oct 2, 2026 15:253,2763,036,166,90327,196,000020,480
9Oct 2, 2026 15:253,2773,036,218,68027,205,000020,480