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 21, 2025 23:37Gerard SmitGerard SmitScore: 60,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 23:3760,534528,592,710500,431,0002,001,0002,314,240
2Jan 21, 2025 23:3760,539531,692,743501,473,0001,000,0002,387,968
3Jan 21, 2025 23:3760,553525,650,220500,589,0001,998,0002,502,656
4Jan 21, 2025 23:3760,562532,510,519500,663,0001,998,0002,387,968
5Jan 21, 2025 23:3760,575529,719,920500,771,0001,999,0002,297,856
6Jan 21, 2025 23:3760,575532,112,203499,777,0002,998,0002,383,872
7Jan 21, 2025 23:3760,587531,411,165499,877,0002,999,0002,297,856
8Jan 21, 2025 23:3760,589529,792,568500,893,0001,999,0002,314,240
9Jan 21, 2025 23:3760,589529,295,339499,892,0002,999,0002,314,240