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 listOct 5, 2026 01:27FrederickFrederickScore: 8,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:288,56782,235,60669,029,0002,082,0002,117,632
2Oct 5, 2026 01:288,61282,631,66469,369,0002,114,0002,113,536
3Oct 5, 2026 01:288,74883,685,20870,550,0002,059,0002,117,632
4Oct 5, 2026 01:288,76183,338,03270,663,0002,054,0002,117,632
5Oct 5, 2026 01:288,88484,195,69771,613,0002,132,0002,117,632
6Oct 5, 2026 01:288,94785,367,95872,178,0002,090,0002,117,632
7Oct 5, 2026 01:288,94884,657,48572,242,0002,029,0002,117,632
8Oct 5, 2026 01:288,96985,601,27372,360,0002,090,0002,117,632
9Oct 5, 2026 01:289,10886,874,96573,530,0002,069,0002,117,632