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 listFeb 18, 2026 15:28wnwnScore: 7,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:287,11779,072,79557,069,0002,002,0002,281,472
2Feb 18, 2026 15:287,12580,530,82657,137,0002,004,0002,281,472
3Feb 18, 2026 15:287,14680,043,27458,303,0001,005,0002,441,216
4Feb 18, 2026 15:287,16180,934,85458,427,0001,007,0002,445,312
5Feb 18, 2026 15:287,16385,021,88658,446,0001,007,0002,531,328
6Feb 18, 2026 15:287,17080,323,82158,503,0001,008,0002,527,232
7Feb 18, 2026 15:287,17790,496,11758,556,0001,009,0002,281,472
8Feb 18, 2026 15:287,17787,621,86458,557,0001,009,0002,281,472
9Feb 18, 2026 15:287,17889,364,00658,566,0001,009,0002,441,216
10Feb 18, 2026 15:287,17985,388,57359,584,00002,281,472
11Feb 18, 2026 15:287,18383,612,16259,618,00002,539,520
12Feb 18, 2026 15:287,20985,786,49958,835,000997,0002,441,216