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 listNov 30, 2025 18:17Rajarshi BasuRajarshi BasuScore: 13,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 18:1713,799140,623,488114,529,00002,273,280
2Nov 30, 2025 18:1713,805140,611,990114,584,00002,269,184
3Nov 30, 2025 18:1713,824142,773,107112,741,0001,995,0002,289,664