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 17, 2026 19:43wnwnScore: 7,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:436,15070,814,56547,044,0004,003,0002,359,296
2Feb 17, 2026 19:396,15172,276,65548,054,0003,003,0002,297,856
3Feb 17, 2026 19:396,16572,575,63749,163,0002,006,0002,519,040
4Feb 17, 2026 19:436,17573,738,15248,238,0003,014,0002,514,944
5Feb 17, 2026 19:396,24478,262,71949,836,0001,993,0002,465,792
6Feb 17, 2026 19:436,27575,075,82649,075,0003,004,0002,265,088
7Feb 17, 2026 19:397,24479,743,42557,116,0003,006,0002,383,872
8Feb 17, 2026 19:397,29890,094,09556,535,0004,038,0002,424,832
9Feb 17, 2026 19:437,33985,286,60557,916,0002,995,0002,404,352
10Feb 17, 2026 19:437,41088,599,53160,498,0001,008,0002,375,680
11Feb 17, 2026 19:397,42790,411,46758,611,0003,031,0002,392,064
12Feb 17, 2026 19:437,64393,017,17862,429,0001,006,0002,396,160