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:08TudyMTudyMScore: 35,007Success
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:0934,998307,986,522289,487,0001,001,0002,301,952
2Apr 26, 2026 16:0935,005310,012,257289,543,0001,001,0002,375,680
3Apr 26, 2026 16:0935,006312,300,260286,561,0003,993,0002,392,064
4Apr 26, 2026 16:0935,006310,780,180289,552,0001,001,0002,379,776
5Apr 26, 2026 16:0935,007311,883,238289,561,0001,001,0002,318,336
6Apr 26, 2026 16:0935,021312,010,706288,682,0001,997,0002,392,064
7Apr 26, 2026 16:0935,029313,836,328287,746,0002,997,0002,383,872
8Apr 26, 2026 16:0935,030305,547,757288,755,0001,998,0002,383,872
9Apr 26, 2026 16:0935,031308,193,950288,762,0001,998,0002,375,680