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 2, 2026 06:05Karthik ReddyKarthik ReddyScore: 3,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 06:053,28536,320,23227,273,000020,480
2Oct 2, 2026 06:053,28936,329,15227,301,000020,480
3Oct 2, 2026 06:053,29336,388,44127,339,000020,480
4Oct 2, 2026 06:053,29636,341,17727,361,000020,480
5Oct 2, 2026 06:053,29836,460,42927,378,000020,480
6Oct 2, 2026 06:053,30136,485,67226,379,0001,027,00020,480
7Oct 2, 2026 06:053,30136,391,14726,375,0001,028,00020,480
8Oct 2, 2026 06:053,31137,472,48126,467,0001,018,00020,480
9Oct 2, 2026 06:053,31736,532,64026,436,0001,103,00020,480