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 6, 2024 21:24Michael KlimenkoMichael KlimenkoScore: 89,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 21:2489,459773,121,321741,508,000999,0002,269,184
2Nov 6, 2024 21:2489,498767,771,924740,838,0001,999,0002,269,184
3Nov 6, 2024 21:2489,510769,515,746740,936,0001,999,0002,289,664
4Nov 6, 2024 21:2489,536767,376,288742,148,0001,000,0002,269,184
5Nov 6, 2024 21:2489,540771,226,713742,180,0001,000,0002,289,664
6Nov 6, 2024 21:2489,550770,203,976742,261,0001,000,0002,289,664
7Nov 6, 2024 21:2489,597768,231,427741,655,0001,999,0002,289,664
8Nov 6, 2024 21:2489,755769,466,720743,970,000999,0002,269,184
9Nov 6, 2024 21:2489,914774,765,106746,285,00002,273,280