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 listJul 9, 2026 17:51boop34boop34Score: 96,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:5196,904814,552,635802,290,0002,019,0002,113,536
2Jul 9, 2026 17:5196,926814,143,516803,492,0001,002,0002,113,536
3Jul 9, 2026 17:5196,950815,121,356802,622,0002,065,0002,113,536
4Jul 9, 2026 17:5196,951814,511,254803,692,0001,002,0002,113,536
5Jul 9, 2026 17:5196,964814,623,116802,713,0002,091,0002,113,536
6Jul 9, 2026 17:5196,964815,174,217802,747,0002,059,0002,113,536
7Jul 9, 2026 17:5196,973815,282,276802,879,0002,004,0002,113,536
8Jul 9, 2026 17:5197,001814,863,209803,109,0002,002,0002,113,536
9Jul 9, 2026 17:5197,013815,488,280803,204,0002,010,0002,113,536