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 16:31Sergey SerebryakovSergey SerebryakovScore: 8,909Success
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 16:318,50596,840,95870,592,00002,383,872
2Mar 10, 2026 16:318,51299,685,88568,657,0001,990,0002,379,776
3Mar 10, 2026 16:318,532100,678,10668,821,0001,994,0002,387,968
4Mar 10, 2026 16:318,90995,935,72672,948,000999,0002,269,184
5Mar 10, 2026 16:318,92296,110,01373,054,0001,000,0002,269,184
6Mar 10, 2026 16:319,012105,841,46573,799,000997,0002,269,184