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 23, 2025 22:51Cameron AavikCameron AavikScore: 21,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 22:5121,099204,011,304120,084,00055,038,0002,371,584
2Jan 23, 2025 22:5121,102207,359,474116,099,00059,050,0002,383,872
3Jan 23, 2025 22:5121,102201,557,256122,105,00053,045,0002,441,216
4Jan 23, 2025 22:5121,142207,109,388114,314,00061,168,0002,473,984
5Jan 23, 2025 22:5121,179207,616,000120,851,00054,932,0002,441,216
6Jan 23, 2025 22:5121,203202,008,632116,993,00058,996,0002,441,216
7Jan 23, 2025 22:5121,309204,813,972116,912,00059,955,0002,420,736
8Jan 23, 2025 22:5121,403210,848,096117,425,00060,218,0002,453,504
9Jan 23, 2025 22:5121,442207,539,310117,981,00059,990,0002,363,392