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 15:13TudyMTudyMScore: 33,486Success
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 15:1433,453295,319,584275,668,0001,997,0002,383,872
2Apr 26, 2026 15:1433,463300,340,838273,752,0003,996,0002,318,336
3Apr 26, 2026 15:1433,480292,342,529275,889,0001,999,0002,387,968
4Apr 26, 2026 15:1433,484298,208,666273,923,0003,998,0002,392,064
5Apr 26, 2026 15:1433,486294,580,626275,937,0001,999,0002,379,776
6Apr 26, 2026 15:1433,487293,117,714275,950,0001,999,0002,387,968
7Apr 26, 2026 15:1433,507297,601,610277,115,0001,000,0002,396,160
8Apr 26, 2026 15:1433,508299,433,925275,117,0003,001,0002,363,392
9Apr 26, 2026 15:1433,510296,858,256277,133,0001,000,0002,387,968