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 22, 2025 08:30hochohochoScore: 220,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 08:30220,3101,857,044,5501,779,612,00048,961,0002,523,136
2Oct 22, 2025 08:30220,3111,856,350,8241,781,619,00046,963,0002,285,568
3Oct 22, 2025 08:30220,3341,856,360,6101,776,806,00051,965,0002,260,992
4Oct 22, 2025 08:30220,3631,856,111,5521,768,045,00060,967,0002,265,088
5Oct 22, 2025 08:30220,3821,860,869,3661,776,192,00052,975,0002,285,568
6Oct 22, 2025 08:30220,4001,862,554,1341,762,345,00066,975,0002,260,992
7Oct 22, 2025 08:30220,4111,853,875,7701,789,424,00039,987,0002,277,376
8Oct 22, 2025 08:30220,4141,865,609,3691,782,452,00046,985,0002,285,568
9Oct 22, 2025 08:30220,4621,853,416,1361,737,894,00091,941,0002,277,376