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 9, 2025 02:29CheranMahalingamCheranMahalingamScore: 51,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2025 02:2951,913454,010,347428,875,0001,999,0002,285,568
2Oct 9, 2025 02:2951,915459,751,765429,895,000999,0002,523,136
3Oct 9, 2025 02:2951,928453,995,456429,004,0002,000,0002,269,184
4Oct 9, 2025 02:2951,930455,165,554429,018,0002,000,0002,277,376
5Oct 9, 2025 02:2951,934454,483,900429,049,0002,000,0002,269,184
6Oct 9, 2025 02:2951,935454,859,967429,061,0002,000,0002,285,568
7Oct 9, 2025 02:2951,943454,696,535430,131,0001,000,0002,285,568
8Oct 9, 2025 02:2951,948453,875,686429,166,0002,000,0002,523,136
9Oct 9, 2025 02:2951,964459,204,675430,302,0001,000,0002,277,376