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 22, 2026 21:54SneedSneedScore: 45,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 21:5445,470400,819,533376,399,0001,001,0002,277,376
2Feb 22, 2026 21:5445,475405,086,315375,439,0002,002,0002,273,280
3Feb 22, 2026 21:5445,713403,142,929377,418,0002,002,0002,514,944
4Feb 22, 2026 21:5445,717411,108,834378,450,0001,001,0002,531,328
5Feb 22, 2026 21:5445,740411,319,272377,647,0001,998,0002,277,376
6Feb 22, 2026 21:5445,741406,750,548376,653,0002,997,0002,277,376
7Feb 22, 2026 21:5445,745409,567,116377,682,0001,998,0002,269,184
8Feb 22, 2026 21:5445,745406,978,015378,685,000999,0002,527,232
9Feb 22, 2026 21:5445,761413,089,969376,817,0002,998,0002,297,856