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 2, 2026 16:57Priyansh RathiPriyansh RathiScore: 41,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 16:5741,502375,529,248342,468,0002,002,0002,359,296
2Mar 2, 2026 16:5741,544374,860,328341,817,0002,998,0002,535,424
3Mar 2, 2026 16:5741,545374,175,868340,826,0003,997,0002,535,424
4Mar 2, 2026 16:5741,558373,699,408343,929,000999,0002,543,616
5Mar 2, 2026 16:5741,638374,111,886343,599,0001,997,0002,396,160
6Mar 2, 2026 16:5741,641376,817,436342,628,0002,996,0002,371,584
7Mar 2, 2026 16:5741,647370,873,904343,670,0001,998,0002,359,296
8Mar 2, 2026 16:5741,670382,803,589343,864,0001,999,0002,371,584
9Mar 2, 2026 16:5741,709379,858,010345,181,0001,000,0002,359,296