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 28, 2026 18:04glegleScore: 43,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 18:0443,802372,912,849362,555,0001,004,0002,113,536
2Jun 28, 2026 18:0443,803372,974,713362,570,0001,003,0002,113,536
3Jun 28, 2026 18:0443,808372,919,180362,604,0001,003,0002,113,536
4Jun 28, 2026 18:0443,824373,512,311362,736,0001,004,0002,113,536
5Jun 28, 2026 18:0443,828373,135,997362,770,0001,005,0002,113,536
6Jun 28, 2026 18:0443,836373,300,562362,842,0001,003,0002,113,536
7Jun 28, 2026 18:0443,858373,430,258363,016,0001,007,0002,113,536
8Jun 28, 2026 18:0443,860373,406,239363,034,0001,005,0002,113,536
9Jun 28, 2026 18:0443,878373,601,314363,190,0001,004,0002,113,536