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 29, 2026 12:57TudyMTudyMScore: 35,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 12:5735,227308,197,786291,387,0001,001,0002,387,968
2Apr 29, 2026 12:5735,240313,688,925291,493,0001,001,0002,379,776
3Apr 29, 2026 12:5735,247315,986,198289,547,0003,005,0002,318,336
4Apr 29, 2026 12:5735,255313,777,488290,627,0001,997,0002,379,776
5Apr 29, 2026 12:5735,259312,103,234290,653,0001,997,0002,383,872
6Apr 29, 2026 12:5735,260314,355,129289,666,0002,996,0002,379,776
7Apr 29, 2026 12:5735,265312,845,088290,703,0001,997,0002,314,240
8Apr 29, 2026 12:5735,273311,451,910289,772,0002,997,0002,379,776
9Apr 29, 2026 12:5735,273309,928,857289,773,0002,997,0002,371,584