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 29, 2025 21:18Rajarshi BasuRajarshi BasuScore: 18,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 21:1818,669178,367,257152,952,0001,999,0002,289,664
2Nov 29, 2025 21:1818,696178,175,041153,174,0002,002,0002,289,664
3Nov 29, 2025 21:1818,709184,477,724153,280,0002,003,0002,273,280
4Nov 29, 2025 21:1818,748182,144,219155,606,00002,519,040
5Nov 29, 2025 21:1818,749181,879,022155,616,00002,289,664
6Nov 29, 2025 21:1818,771186,305,078153,804,0001,997,0002,289,664
7Nov 29, 2025 21:1818,771183,759,826154,805,000998,0002,289,664
8Nov 29, 2025 21:1818,777180,194,550153,855,0001,998,0002,285,568
9Nov 29, 2025 21:1818,820188,780,470154,203,0002,002,0002,519,040