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 16, 2026 10:07tch1001tch1001Score: 63,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 10:0763,765549,974,576529,253,00002,273,280
2Feb 16, 2026 10:0763,768551,289,799528,274,0001,000,0002,273,280
3Feb 16, 2026 10:0763,773557,021,126529,314,00002,273,280
4Feb 16, 2026 10:0763,782558,710,607528,391,0001,000,0002,273,280
5Feb 16, 2026 10:0763,789561,970,100529,449,00002,519,040
6Feb 16, 2026 10:0763,805557,630,447526,587,0002,997,0002,273,280
7Feb 16, 2026 10:0763,817562,192,735527,687,0001,998,0002,273,280
8Feb 16, 2026 10:0763,822558,163,817527,725,0001,998,0002,273,280
9Feb 16, 2026 10:0763,911557,737,778527,468,0002,996,0002,273,280