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 listOct 31, 2026 10:47Anirudha SarafAnirudha SarafScore: 89,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 10:4888,987750,002,593679,927,00058,667,00020,480
2Oct 31, 2026 10:4889,006749,791,922679,960,00058,792,00020,480
3Oct 31, 2026 10:4889,058750,669,205679,193,00059,996,00020,480
4Oct 31, 2026 10:4889,066750,780,310679,860,00059,390,00020,480
5Oct 31, 2026 10:4889,087750,879,535679,375,00060,053,0002,113,536
6Oct 31, 2026 10:4889,087750,419,283680,039,00059,386,0002,113,536
7Oct 31, 2026 10:4889,120750,798,860679,772,00059,932,00020,480
8Oct 31, 2026 10:4889,136751,475,782679,204,00060,632,00020,480
9Oct 31, 2026 10:4889,145751,071,486679,995,00059,910,00020,480