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 09:51PROgrm_JARvisPROgrm_JARvisScore: 351,668Success
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 09:51346,3932,934,625,2582,875,064,16602,199,552
2Jul 31, 2023 09:51351,6682,988,963,6492,918,842,61002,187,264
3Jul 31, 2023 09:51352,2602,987,862,1242,923,755,76802,195,456