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 listFeb 6, 2025 10:08E SequeiraE SequeiraScore: 107,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:08107,447918,777,342832,820,00058,987,0002,469,888
2Feb 6, 2025 10:08107,569914,919,844832,837,00059,988,0002,465,792
3Feb 6, 2025 10:08107,755925,229,235831,413,00062,955,0002,326,528