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 listJan 31, 2025 16:18AdityaAdityaScore: 77,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 16:1877,235666,317,670565,042,00076,005,0002,269,184
2Jan 31, 2025 16:1877,271670,977,155575,317,00066,036,0002,502,656
3Jan 31, 2025 16:1877,295667,912,830574,593,00066,952,0002,383,872
4Jan 31, 2025 16:1877,430669,872,647590,698,00051,973,0002,273,280
5Jan 31, 2025 16:1877,439665,548,077582,767,00059,976,0002,273,280
6Jan 31, 2025 16:1877,450669,510,948570,853,00071,981,0002,383,872
7Jan 31, 2025 16:1877,473664,952,746577,024,00066,002,0002,273,280
8Jan 31, 2025 16:1877,484665,041,773577,106,00066,012,0002,273,280
9Jan 31, 2025 16:1877,505672,959,709576,263,00067,030,0002,285,568