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 listSep 24, 2026 03:09wnwnScore: 3,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:093,31036,195,77727,473,000020,480
2Sep 24, 2026 03:093,31536,350,81627,521,000020,480
3Sep 24, 2026 03:093,32336,352,70027,589,000020,480
4Sep 24, 2026 03:093,33136,457,62026,641,0001,007,0002,113,536
5Sep 24, 2026 03:093,36136,686,04627,899,000020,480
6Sep 24, 2026 03:093,42237,184,59227,403,0001,006,0002,113,536
7Sep 24, 2026 03:093,49238,327,24927,921,0001,063,0002,113,536
8Sep 24, 2026 03:093,50338,510,43528,073,0001,009,0002,113,536
9Sep 24, 2026 03:093,50338,387,86929,082,000020,480