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 listDec 6, 2025 12:03Rajarshi BasuRajarshi BasuScore: 6,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 12:036,78575,306,60054,302,0002,011,0002,379,776
2Dec 6, 2025 12:036,78779,176,56455,324,0001,005,0002,277,376
3Dec 6, 2025 12:036,92781,053,71656,490,0001,008,0002,277,376
4Dec 6, 2025 12:036,93985,729,39556,584,0001,010,0002,289,664
5Dec 6, 2025 12:036,94383,701,27956,618,0001,011,0002,265,088
6Dec 6, 2025 12:037,08586,707,89557,806,000996,0002,273,280