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 listJul 31, 2023 10:02PROgrm_JARvisPROgrm_JARvisScore: 615,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2023 10:02615,3995,184,719,0805,107,807,82902,256,896
2Jul 31, 2023 10:02615,5115,168,665,3305,108,738,71402,191,360
3Jul 31, 2023 10:02617,6465,194,502,8345,126,460,79302,199,552