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 listApr 26, 2026 16:03TudyMTudyMScore: 41,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:0640,319347,896,158330,658,0003,995,0002,375,680
2Apr 26, 2026 16:0640,350350,838,432332,911,0001,999,0002,306,048
3Apr 26, 2026 16:0640,354353,501,789331,942,0002,999,0002,392,064
4Apr 26, 2026 16:0641,668362,106,120343,852,0001,999,0002,387,968
5Apr 26, 2026 16:0641,680362,136,629343,951,0001,999,0002,383,872
6Apr 26, 2026 16:0641,691366,276,771344,040,0002,000,0002,318,336
7Apr 26, 2026 16:0641,700363,111,523345,114,0001,000,0002,396,160
8Apr 26, 2026 16:0641,703360,717,362345,136,0001,000,0002,379,776
9Apr 26, 2026 16:0641,714367,010,712344,226,0002,001,0002,387,968