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 listJan 9, 2026 21:29Alexander FrolovAlexander FrolovScore: 48,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 21:2948,234422,415,397399,340,0001,000,0002,269,184
2Jan 9, 2026 21:2948,235422,135,209399,348,0001,000,0002,277,376
3Jan 9, 2026 21:2948,237432,049,583399,367,0001,000,0002,482,176
4Jan 9, 2026 21:2948,257427,265,756398,534,0001,997,0002,277,376
5Jan 9, 2026 21:2948,259430,560,996399,545,0001,001,0002,482,176
6Jan 9, 2026 21:2948,817428,232,211404,179,0001,000,0002,277,376
7Jan 9, 2026 21:2948,830436,433,488404,292,0001,000,0002,482,176
8Jan 9, 2026 21:2948,841427,532,785404,383,0001,000,0002,277,376
9Jan 9, 2026 21:2948,855428,113,614403,503,0001,997,0002,482,176