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 listNov 13, 2024 15:18DanusanDanusanScore: 867,171Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 15:18866,8937,229,722,1277,084,268,000110,941,0002,437,120
2Nov 13, 2024 15:18867,1717,230,018,9647,087,577,000109,946,0002,342,912
3Nov 13, 2024 15:18868,6277,239,535,4757,115,661,00093,942,0002,289,664