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 13, 2025 14:54Dave GunawanDave GunawanScore: 388,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2025 14:54388,8623,252,307,6403,163,584,00063,971,0002,281,472
2Feb 13, 2025 14:54388,9003,260,641,5733,147,927,00079,947,0002,281,472
3Feb 13, 2025 14:54388,9113,257,077,5943,148,009,00079,949,0002,293,760
4Feb 13, 2025 14:54388,9373,257,717,0473,152,217,00075,957,0002,510,848
5Feb 13, 2025 14:54388,9733,261,137,7703,148,512,00079,962,0002,281,472
6Feb 13, 2025 14:54389,1923,255,728,7203,154,334,00075,959,0002,293,760
7Feb 13, 2025 14:54389,7103,259,758,9153,162,628,00071,968,0002,281,472
8Feb 13, 2025 14:54389,9133,266,878,2353,177,310,00058,968,0002,293,760
9Feb 13, 2025 14:54397,3753,321,433,0283,223,255,00074,959,0002,510,848