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 listMar 15, 2026 19:21Ondřej PolaneckýOndřej PolaneckýScore: 18,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:2118,398175,284,557150,706,0001,996,0002,289,664
2Mar 15, 2026 19:2118,411176,816,439150,815,0001,997,0002,277,376
3Mar 15, 2026 19:2118,417181,355,212151,866,000999,0002,289,664
4Mar 15, 2026 19:2118,419175,481,556151,878,000999,0002,289,664
5Mar 15, 2026 19:2118,420181,283,658150,889,0001,998,0002,285,568
6Mar 15, 2026 19:2118,426179,056,040150,939,0001,999,0002,289,664
7Mar 15, 2026 19:2118,431183,354,983150,977,0001,999,0002,289,664
8Mar 15, 2026 19:2118,431176,273,051150,982,0001,999,0002,289,664
9Mar 15, 2026 19:2118,431184,147,026150,982,0001,999,0002,273,280