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 11, 2024 16:46Joad NacerJoad NacerScore: 4,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:464,43857,871,00633,848,0002,986,0002,392,064
2Oct 11, 2024 16:464,45562,227,33933,976,0002,997,0002,351,104
3Oct 11, 2024 16:464,45862,839,29034,002,0003,000,0002,297,856
4Oct 11, 2024 16:464,51457,716,00936,455,0001,012,0002,387,968
5Oct 11, 2024 16:464,52057,761,67335,487,0002,027,0002,273,280
6Oct 11, 2024 16:464,53262,197,03335,581,0002,033,0002,301,952