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 10, 2026 17:10caandocaandoScore: 5,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:104,99864,953,70241,485,00002,285,568
2Mar 10, 2026 17:015,01068,361,88040,565,0001,014,0002,285,568
3Mar 10, 2026 17:015,01272,606,77540,589,0001,014,0002,506,752
4Mar 10, 2026 17:015,01672,654,90340,619,0001,015,0002,523,136
5Mar 10, 2026 17:105,03968,723,52339,833,0001,991,0002,285,568
6Mar 10, 2026 17:105,04269,825,58739,856,0001,992,0002,285,568
7Mar 10, 2026 17:105,04470,560,02540,873,000996,0002,285,568
8Mar 10, 2026 17:105,06063,992,73540,001,0002,000,0002,387,968
9Mar 10, 2026 17:105,13072,603,58942,575,00002,519,040