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 28, 2025 02:11zypehzypehScore: 47,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 02:1147,489416,935,361393,158,0001,000,0002,371,584
2Dec 28, 2025 02:1147,498417,182,375391,229,0003,001,0002,347,008
3Dec 28, 2025 02:1147,556427,488,588393,718,000999,0002,347,008
4Dec 28, 2025 02:1147,565419,907,333392,794,0001,998,0002,347,008
5Dec 28, 2025 02:1147,569422,073,309392,826,0001,999,0002,347,008
6Dec 28, 2025 02:1147,571421,327,529393,837,000999,0002,347,008
7Dec 28, 2025 02:1147,572421,050,953392,849,0001,999,0002,347,008
8Dec 28, 2025 02:1147,573421,143,975392,861,0001,999,0002,347,008
9Dec 28, 2025 02:1147,821422,310,467394,919,0001,999,0002,371,584