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 5, 2023 16:50AlexeyAlexeyScore: 342,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2023 16:50341,9052,913,169,1672,837,809,35602,260,992
2Oct 5, 2023 16:50342,1072,895,900,9352,839,485,50602,187,264
3Oct 5, 2023 16:50342,1262,905,180,1712,839,644,24802,187,264
4Oct 5, 2023 16:50342,5942,915,350,4172,843,526,58002,187,264
5Oct 5, 2023 16:50342,7442,912,464,4652,844,778,84102,273,280
6Oct 5, 2023 16:50343,4232,919,533,7782,850,407,16902,191,360