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 12:11Cameron AavikCameron AavikScore: 21,883Success
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 12:1121,803214,433,387121,649,00059,316,0002,453,504
2Jan 23, 2025 12:1121,825204,148,625121,099,00060,049,0002,441,216
3Jan 23, 2025 12:1121,828208,692,596123,119,00058,056,0002,437,120
4Jan 23, 2025 12:1121,880206,063,339124,412,00057,189,0002,457,600
5Jan 23, 2025 12:1121,883208,729,905129,448,00052,180,0002,375,680
6Jan 23, 2025 12:1121,902206,255,771117,863,00063,926,0002,457,600
7Jan 23, 2025 12:1121,910212,505,052119,905,00061,951,0002,457,600
8Jan 23, 2025 12:1122,081208,326,926124,184,00059,087,0002,424,832
9Jan 23, 2025 12:1122,143208,083,356123,859,00059,932,0002,363,392