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 listJun 22, 2026 11:58Omkar SinghOmkar SinghScore: 67,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 12:0267,660570,696,476502,498,00059,085,0002,113,536
2Jun 22, 2026 12:0267,673570,764,834502,017,00059,669,0002,113,536
3Jun 22, 2026 12:0267,705571,056,761502,573,00059,382,0002,113,536
4Jun 22, 2026 12:0267,706571,150,872502,321,00059,646,0002,113,536
5Jun 22, 2026 12:0267,717571,428,742502,740,00059,315,0002,113,536
6Jun 22, 2026 12:0267,745571,290,634502,689,00059,597,0002,113,536
7Jun 22, 2026 12:0267,787571,736,684502,096,00060,539,0002,113,536
8Jun 22, 2026 12:0267,815572,097,302502,530,00060,338,0002,113,536
9Jun 22, 2026 12:0267,875572,403,317502,352,00061,017,0002,113,536