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 5, 2026 20:37lipapipalipapipaScore: 69,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:3769,137596,376,026511,856,00061,982,000307,200
2Jan 5, 2026 20:3769,191599,916,714516,361,00057,928,000311,296
3Jan 5, 2026 20:3769,199601,489,690511,422,00062,928,000299,008
4Jan 5, 2026 20:3769,255600,422,123511,837,00062,980,000307,200
5Jan 5, 2026 20:3769,268603,716,468514,931,00059,992,0002,408,448
6Jan 5, 2026 20:3769,287599,530,737514,178,00060,902,000311,296
7Jan 5, 2026 20:3769,383605,696,742510,894,00064,986,000311,296
8Jan 5, 2026 20:3769,386605,749,670515,912,00059,989,000307,200
9Jan 5, 2026 20:3769,507604,113,195515,024,00061,882,000176,128