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 listFeb 27, 2026 04:29user76135user76135Score: 54,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 04:2953,963470,990,481445,892,0001,999,0002,277,376
2Feb 27, 2026 04:2953,993471,634,265448,144,00002,277,376
3Feb 27, 2026 04:2954,008470,040,995447,270,0001,000,0002,277,376
4Feb 27, 2026 04:2954,028473,084,382446,439,0001,997,0002,277,376
5Feb 27, 2026 04:2954,044474,284,947447,564,000999,0002,277,376
6Feb 27, 2026 04:2954,378477,182,305450,340,0001,000,0002,404,352
7Feb 27, 2026 04:2954,387480,455,300451,411,00002,408,448
8Feb 27, 2026 04:2954,389476,254,900451,432,00002,277,376
9Feb 27, 2026 04:2954,476473,054,203451,149,0001,000,0002,400,256